import sys
import math

n = int(sys.argv[1])

n2 = int(math.sqrt(n+1))

def search1(n):
    for i in range(2, int(n2+1)):
        if n%i == 0:
            print(i)

def search2(n):
    for i in range(2, len(primes)):
        if primes[i]:
            if n%i == 0:
                print(i)

def sieve(n):
    global primes
    primes = n2*[True]
    ns = math.sqrt(n2+1)
    l = 2
    while l < ns:
        f = 2*l
        while f < n2:
            primes[f] = False
            f = f+l
        #print(primes)
        l += 1
        while l < ns and not primes[l]:
            l += 1

if True:
    sieve(n)
    if False:
        lastp = None
        for i in range(n2):
            if primes[i]:
                lastp = i
                #print(i)
                pass
        print(lastp)

search2(n)
search2(n)
# 200000000041