#include <bits/stdc++.h>
using namespace std;
const long long int mxN = 1e12 + 1;
const long long int MOD = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
void solve() {
  set<pair<long long int, long long int>> s;
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (lcm(i, n / i) == n) s.insert(make_pair(i, n / i));
    }
  }
  pair<long long int, long long int> mn(mxN, mxN);
  for (auto a : s) {
    long long int x = max(a.first, a.second);
    long long int y = max(mn.first, mn.second);
    if (x < y) {
      mn = a;
    }
  }
  cout << mn.first << " " << mn.second << "\n";
}
signed main() {
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
