# coding: utf-8

from bisect import bisect_left

def primes(n):

    is_prime = [True] * (n + 1)

    is_prime[0] = False

    is_prime[1] = False

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

        if not is_prime[i]:

            continue

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

            is_prime[j] = False

    return [i for i in range(n + 1) if is_prime[i]]

X = int(eval(input()))

L = primes(10**6)

idx = bisect_left(L, X)

print((L[idx]))
# coding: utf-8

def elatostenes(x):

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

        if x % i == 0:

            return False

    return True



X = int(eval(input()))

while True:

    if elatostenes(X):

        print(X)

        exit()

    else:

        X += 1
# coding: utf-8
from bisect import bisect_left


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]


X = int(eval(input()))
L = primes(10**6)
idx = bisect_left(L, X)
print((L[idx]))

# coding: utf-8
def elatostenes(x):
    for i in range(2, int(x**0.5) + 1):
        if x % i == 0:
            return False
    return True


X = int(eval(input()))
while True:
    if elatostenes(X):
        print(X)
        exit()
    else:
        X += 1

-from bisect import bisect_left - - -def primes(n): -    is_prime = [True] * (n + 1) -    is_prime[0] = False -    is_prime[1] = False -    for i in range(2, int(n**0.5) + 1): -        if not is_prime[i]: -            continue -        for j in range(i * 2, n + 1, i): -            is_prime[j] = False -    return [i for i in range(n + 1) if is_prime[i]] +def elatostenes(x): +    for i in range(2, int(x**0.5) + 1): +        if x % i == 0: +            return False +    return True -L = primes(10**6) -idx = bisect_left(L, X) -print((L[idx])) +while True: +    if elatostenes(X): +        print(X) +        exit() +    else: +        X += 1