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 gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
  ios::sync_with_stdio(false);
  long long x;
  cin >> x;
  long long sq = sqrt(x);
  long long sol = x;
  long long a = 1;
  long long b = x;
  for (long long i = 1; i <= sq + 1; i++) {
    if (x % i == 0) {
      long long t = x / i;
      if (gcd(t, i) == 1) {
        if (sol > max(t, i)) {
          sol = max(t, i);
          a = t;
          b = i;
        }
      }
    }
  }
  cout << a << " " << b << endl;
  return 0;
}