def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
def max_prime(n):
max_prime = 1
for i in range(2, n + 1):
if is_prime(i):
max_prime = i
return max_prime
# 输入
n = int(input())
# 处理
max_prime_n = max_prime(n)
# 输出
print(max_prime_n)