import numpy as np



n = 1000003

primes = set(range(2, n+1))



for i in range(2, int(n**0.5+1)):

    primes.difference_update(list(range(i*2, n+1, i)))



primes = np.array(list(primes))



x = int(eval(input()))



print((primes[np.where(primes>=x)][0]))
n = 10**5 + 3

primes = set(range(3, n+1, 2))



for i in range(3, int(n**0.5+1)):

    primes.difference_update(list(range(i*2, n+1, i)))

primes.add(2)

primes = list(primes)

primes.sort()



x = int(eval(input()))



primes = [y for y in primes if y >= x]



print((primes[0]))
import numpy as np

n = 1000003
primes = set(range(2, n + 1))
for i in range(2, int(n**0.5 + 1)):
    primes.difference_update(list(range(i * 2, n + 1, i)))
primes = np.array(list(primes))
x = int(eval(input()))
print((primes[np.where(primes >= x)][0]))

n = 10**5 + 3
primes = set(range(3, n + 1, 2))
for i in range(3, int(n**0.5 + 1)):
    primes.difference_update(list(range(i * 2, n + 1, i)))
primes.add(2)
primes = list(primes)
primes.sort()
x = int(eval(input()))
primes = [y for y in primes if y >= x]
print((primes[0]))

-import numpy as np - -n = 1000003 -primes = set(range(2, n + 1)) -for i in range(2, int(n**0.5 + 1)): +n = 10**5 + 3 +primes = set(range(3, n + 1, 2)) +for i in range(3, int(n**0.5 + 1)): -primes = np.array(list(primes)) +primes.add(2) +primes = list(primes) +primes.sort() -print((primes[np.where(primes >= x)][0])) +primes = [y for y in primes if y >= x] +print((primes[0]))