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

map<long, int> pf(long n) {
  map<long, int> ma;
  for (long i = 2; i * i <= n; i++) {
    while (n % i == 0) ma[i]++, n /= i;
  }
  if (n != 1) ma[n]++;
  return ma;
}

int main() {
  int N;
  cin >> N;
  int ans1 = 1, ans2 = 1;
  for (auto [a, b] : pf(N)) (b == 1) ? ans2 *= a : ans1 *= sqrt(pow(a, b));
  cout << ans1 << " " << ans2 << "\n";
}