Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(a, b) such that LCM(a, b) equals X. Both a and b should be positive integers.

LCM(a, b) is the smallest positive integer that is divisible by both a and b. For example, LCM(6, 8) = 24, LCM(4, 12) = 12, LCM(2, 3) = 6.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input

The first and only line contains an integer X (1 ≤ X ≤ 10^{12}).

Output

Print two positive integers, a and b, such that the value of max(a, b) is minimum possible and LCM(a, b) equals X. If there are several possible such pairs, you can print any.

Examples

Input


2


Output


1 2


Input


6


Output


2 3


Input


4


Output


1 4


Input


1


Output


1 1
"""609C"""
import math
# import sys
def gcd(a,b):
	if a==0:
		return b
	else:
		return gcd(b%a,a)
def lcm(a,b):
	return (a*b)//gcd(a,b)
def  main():
	x = int(input())
	temp = -1
	mx = math.inf
	i = 2
	while i*i<=x:
		if x%i==0 and lcm(i,x//i)==x:
			# print(i)
			# print(i)
			temp = max(i,int(x//i))
		if temp!=-1:
			mx = min(mx,temp)
		i+=1
	if temp==-1:
		print(1,x)
	else:
		print(mx,int(x//mx))
		
	return

main()
# def test():
# 	t = int(input())
# 	while t:
# 		main()
# 		t-=1
# test()
