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 fun(long long a, long long b) {
  if (a == 0) return b;
  return fun(b % a, a);
}
int main() {
  long long x;
  cin >> x;
  long long ans = 1e18;
  long long pa, pb;
  for (long long i = 1; i * i <= x; i++) {
    long long a = i;
    long long b = x / i;
    if ((a * b) == x) {
      long long g = fun(a, b);
      long long lcm = x / g;
      if (lcm == x) {
        if (ans > b) {
          ans = b;
          pa = a;
          pb = b;
        }
      }
    }
  }
  cout << pa << " " << pb << endl;
  return 0;
}