# brute-force
n = int(raw_input())
f = 2
while n > 1:
while n % f == 0:
n //= f
f += 1
print "max prime factor", (f - 1)
IyBicnV0ZS1mb3JjZQpuID0gaW50KHJhd19pbnB1dCgpKQpmID0gMgp3aGlsZSBuID4gMToKICAgIHdoaWxlICBuICUgZiA9PSAwOgogICAgICAgICBuIC8vPSBmCiAgICBmICs9IDEKICAgCnByaW50ICJtYXggcHJpbWUgZmFjdG9yIiwgKGYgLSAxKQ==