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 sys
input = sys.stdin.readline

x=int(input())
y=x
ANS=x+1
AX=[0,0]

import math
L=int(math.sqrt(x))

FACT=dict()

for i in range(2,L+2):
    while x%i==0:
        FACT[i]=FACT.get(i,0)+1
        x=x//i

if x!=1:
    FACT[x]=FACT.get(x,0)+1
x=y
LEN=len(FACT)
LIST=list(FACT.keys())
for i in range(1<<LEN):
    sc=1
    for j in range(LEN):
        if i & (1<<j) !=0:
            sc*=LIST[j]**FACT[LIST[j]]

    if ANS>max(sc,x//sc):
        ANS=max(sc,x//sc)
        AX=[sc,x//sc]

print(*AX)
