Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a % b == 0) return (b);
  return (gcd(b, a % b));
}
int main() {
  long long int x, a = 1, b = 1, n1, n2;
  cin >> x;
  for (int i = 1; i <= (int)floor(sqrt(x)); i++) {
    if (x % i != 0) continue;
    n1 = i, n2 = x / i;
    if (((n1 * n2) / gcd(n2, n1)) == x) a = n1, b = n2;
  }
  cout << a << " " << b << endl;
  return (0);
}