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
import math
def next_prime(num):
	return num + 1
		
def find_all_factors(num):
	factors = [1, 1]
	last_tried = 1
	max_limit = int(math.sqrt(num)) + 1
	while num > 1 and last_tried <= max_limit:
		last_tried = next_prime(last_tried)
		addable = 1
		while True:
			if num % last_tried == 0:
				addable *= last_tried
				num = num // last_tried
			else:
				if addable != 1: factors.append(addable)
				break
	if num > 1:
		factors.append(num)
	return factors
	
def correct_factors(factors):
	corrected = [1]
	for i in factors:
		if corrected[-1]%i == 0:
			corrected[-1] *= i
		else:
			corrected.append(i)
	return corrected
	
def distribute_factors(num, factors, answers = []):
	if len(answers) < len(factors):
		max1 = distribute_factors(num, factors, answers + [1])
		max2 = distribute_factors(num, factors, answers + [0])
		return min(max1, max2)
	else:
		num1 = 1
		for i in range(len(answers)):
			if answers[i]: num1 *= factors[i]
		if num1 == 0: return num
		num2 = num // num1
		return max(num1, num2)

def main(number):
	answer = distribute_factors(number, find_all_factors(number))
	return str(number//answer) + " " + str(answer)


number = int(input())
print(main(number))