def is_prime(n):
if n < 2:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def next_prime(n):
while True:
n += 1
if is_prime(n):
return n
n = int(input())
p1 = next_prime(1)
p2 = next_prime(p1)
while p1 * p2 <= n:
p1, p2 = p2, next_prime(p2)
print(p1 * p2)
PREVIOUS[백준] 색종이 만들기