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

def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def MAP2():return map(float,input().split())
def LIST(): return list(map(int, input().split()))
def STRING(): return input()
from heapq import heappop , heappush
from bisect import *
from collections import deque , Counter
from math import *
from itertools import permutations
dx = [-1 , 1 , 0 , 0  ]
dy = [0 , 0  , 1  , - 1]
#visited = [[False for i in range(m)] for j in range(n)]
#for tt in range(INT()):

def lcm(a , b):
    return (a * b) // gcd(a , b)

def pfs(n):
    a = []
    i = 1
    while i * i <= n :
        if n % i == 0 :
            if n // i == i :
                a.append(i)
            else:
                a.append(i)
                a.append(n//i)
        i+=1

    return a

x = INT()
if x == 1 :
    print(1 , 1)
    exit(0)
r = pfs(x)
ans = []

for i in range(len(r)):
    if lcm(r[i] , x//r[i]) == x :
        ans.append([r[i] , x//r[i] , (r[i] + (x//r[i]))])

ans = sorted(ans , key= lambda x :x[2])
#print(ans)
z = ans[0]
print(z[0] , z[1])
