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
#include <bits/stdc++.h>
using namespace std;
int prime[1000003], tot;
bool vis[1000003];
void shai(long long X) {
  tot = 0;
  memset(vis, 0, sizeof(vis));
  for (long long i = 2; i < X; i++) {
    if (!vis[i]) {
      prime[tot++] = i;
    }
    for (long long j = 0; j < tot && prime[j] * i < X; j++) {
      vis[i * prime[j]] = 1;
      if (i % prime[j] == 0) {
        break;
      }
    }
  }
}
int q[100003], t[100003], len;
bool can[10000003];
int main() {
  long long n, m;
  cin >> n;
  if (n == 1) {
    cout << "1 1";
    return 0;
  }
  shai((int)(sqrt(n)) + 10);
  int i = 0;
  m = n, len = 0;
  while (1) {
    if (i >= tot) break;
    if ((long long)prime[i] * (long long)prime[i] > n) break;
    if (m % (long long)prime[i] == 0) {
      m /= prime[i];
      ++len;
      q[len] = i;
      t[len] = 1;
      while (m % prime[i] == 0) m /= prime[i], t[len]++;
    }
    if (m == 1) break;
    ++i;
  }
  int sqr = (int)sqrt(n) + 1;
  memset(can, 0, sizeof(can));
  can[1] = true;
  for (register int i = 1; i <= len; i++) {
    bool f = 0;
    long long tmp = 1;
    for (int j = 1; j <= t[i]; j++) {
      tmp *= prime[q[i]];
      if (tmp > sqr) {
        f = 1;
        break;
      }
    }
    int lens = sqr / tmp;
    if (f) continue;
    for (register int j = lens; j >= 1; --j)
      if (can[j]) can[j * tmp] = 1;
  }
  for (register int i = sqr - 1; i >= 1; i--) {
    if (can[i]) {
      printf("%d %I64d", i, n / i);
      return 0;
    }
  }
  return 1;
}
