#include <bits/stdc++.h>
using namespace std;

template <typename T>
map<T, int> primeFactorize(T n) {
  map<T, int> ans;
  for (T i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      n /= i;
      ans[i]++;
    }
  }
  if (n > 1) {
    ans[n]++;
  }
  return ans;
}

int main() {
  int n;
  cin >> n;

  map<int, int> p = primeFactorize(n);

  int b = 1;
  int a = 1;
  for (auto &e: p) {
    if (e.second & 1) {
      b *= e.first;
    }
    a *= pow(e.first, e.second / 2);
  }
  cout << a << ' ' << b << '\n';
  return 0;
}