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
# -*- coding: utf-8 -*-
import sys

import math

input = sys.stdin.readline


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


def main():
    X = int(input())
    smallest = 10 ** 12
    ret = None
    for n in range(1, int(math.sqrt(X)) + 1):
        if X % n == 0:
            n1, n2 = n, X // n
            if lcm(n1, n2) != X:
                continue
            smallest = min(smallest, max(n1, n2))
            ret = n, X // n
    print(ret[0], ret[1])


if __name__ == '__main__':
    main()
