#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(a, b) for(ll a=0;a<b;a++)
#define rep(a, b, c) for(ll a=b;a<c;a++)
#define lb lower_bound
#define ub upper_bound
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

vvl factorize(ll n) {
  vvl ret;
  for(ll i = 2; i * i <= n; i++) {
    ll c = 0;
    while(n % i == 0) n /= i, c++;
    if(c!=0) ret.push_back(vll{i, c});
  }
  if(n != 1) ret.push_back(vll{n, 1});
  return ret;
}
int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vvl f = factorize(n);
  ll ans = 1;
  ll ret = 1;
  for(auto e:f){
    if(e[1]%2) ans *= e[0];
    for(int j=0;j<e[1]/2;j++) ret *= e[0];
  }
  std::cout << ret << " " << ans << '\n';
  // n = aab

  return 0;
}