#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
vector<long long> pf(long long x) {
  long long i = 2;
  vector<long long> pfs;
  while (i <= sqrt(x)) {
    if (x % i == 0) {
      long long cur = 1;
      while (x % i == 0) {
        cur *= i;
        x /= i;
      }
      pfs.push_back(cur);
    } else {
      i++;
    }
  }
  if (x >= 2) {
    pfs.push_back(x);
  }
  sort(pfs.begin(), pfs.end());
  return pfs;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long x;
  cin >> x;
  if (x == 1) {
    cout << "1 1\n";
    return 0;
  }
  vector<long long> pfs = pf(x);
  long long a = 1, b = x, ans = x, i = 0, j = pfs.size() - 1;
  while (i <= j) {
    ans = min(ans, max(a * pfs[i], b / pfs[i]));
    ans = min(ans, max(a * pfs[j], b / pfs[j]));
    if (i != j) {
      ans = min(ans, max(a * pfs[i] * pfs[j], b / (pfs[i] * pfs[j])));
      a *= pfs[i] * pfs[j];
      b /= pfs[i] * pfs[j];
    }
    i++;
    j--;
  }
  cout << ans << " " << x / ans << "\n";
  return 0;
}
