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 == 0) return b;
  return gcd(b % a, a);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  if (n == 1) {
    cout << "1 1"
         << "\n";
  } else {
    long long int minn = n;
    vector<long long int> v;
    vector<long long int> vv;
    long long int a = 1, b = n;
    for (long long int i = 1; i <= sqrt(n); i++) {
      if (n % i == 0) {
        long long int x = n / i;
        if (gcd(i, x) == 1) {
          long long int k = max(i, x);
          if (k < minn) {
            a = min(i, x);
            b = max(i, x);
            minn = k;
          }
        }
      }
    }
    cout << a << " " << b << "\n";
  }
  return 0;
}