output_description: Print the minimum prime number greater than or equal to X.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X
attempt: import numpy as np
  
  a = np.array(
      [
          2,
          3,
          5,
          7,
          11,
          13,
          17,
          19,
          23,
          29,
          31,
          37,
          41,
          43,
          47,
          53,
          59,
          61,
          67,
          71,
          73,
          79,
          83,
          89,
          97,
          101,
          103,
          107,
          109,
          113,
          127,
          131,
          137,
          139,
          149,
          151,
          157,
          163,
          167,
          173,
          179,
          181,
          191,
          193,
          197,
          199,
          211,
          223,
          227,
          229,
          233,
          239,
          241,
          251,
          257,
          263,
          269,
          271,
          277,
          281,
          283,
          293,
          307,
          311,
          313,
          317,
          331,
          337,
          347,
          349,
          353,
          359,
          367,
      ]
  )
  candidate = int(input())
  
  
  while True:
      if ((candidate / a[a < candidate]) % 1 == 0).any():
          candidate += 1
      else:
          break
  print(candidate)
  
problem_description: Statement
  
  Find the minimum prime number greater than or equal to X.
samples: [{"input": "20", "output": "23\n    \n\nThe minimum prime number greater than or equal to 20 is 23.\n\n* * *"}, {"input": "2", "output": "2\n    \n\nX itself can be a prime number.\n\n* * *"}, {"input": "99992", "output": "100003"}]