import math def prime(): n=int(input()) for i in range(2,int(math.sqrt(n))+1): if n%i==0: return i,n//i return 1,n a,b=prime() print(a,b)