#include <bits/stdc++.h>
#define ll __int128_t
#define lll __int128_t
#define enl putchar('\n')
#define all(x) (x).begin(),(x).end()
#define debug(x) printf(" "#x":%d\n",x);
using namespace std;
const int MAXN = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
typedef pair<int, int> pii;
char buf[1 << 21], * p1 = buf, * p2 = buf, obuf[1 << 21], * o = obuf, of[35];
// #define gc()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
#define gc() getchar()
inline ll qpow(ll a, ll n) { ll res = 1; while (n) { if (n & 1)res = res * a % mod; n >>= 1; a = a * a % mod; }return res; }
template <class T = int>inline T read() { T s = 0, f = 1; char c = gc(); for (; !isdigit(c); c = gc())if (c == '-')f = -1; for (; isdigit(c); c = gc())s = s * 10 + c - '0'; return s * f; }
inline void read(int* a, int n) { for (int i = 1; i <= n; ++i)a[i] = read(); }
inline int inal(char* s) { int n = 0; for (s[0] = gc(); !isalpha(s[0]); s[0] = gc()); for (; isalpha(s[n]); s[++n] = gc()); return s[n] = 0, n; }
inline int indi(char* s) { int n = 0; for (s[0] = gc(); !isdigit(s[0]); s[0] = gc()); for (; isdigit(s[n]); s[++n] = gc()); return s[n] = 0, n; }
inline void outd(auto* a, int n) { for (int i = 1; i <= n; ++i)printf("%d ", a[i]); enl; }
int n, m, q;
ll abs(ll x) { return x > 0 ? x : -x; }

void write(lll x) {
    static int oc[100], top; top = 0;
    while (x) {
        oc[++top] = x % 10;
        x /= 10;
    }
    while (top) {
        putchar(oc[top--] + '0');
    }
    putchar(' ');
}
template<class T = lll>
T randint(T l, T r = 0) {
    static mt19937_64 eng(time(0));
    if (l > r) swap(l, r);
    // uniform_int_distribution<long long> dis(l, r);
    // return dis(eng);
    ll d = r - l + 1;
    ll v = ((ll)eng() << 64) + eng();
    v = abs(v);
    // printf("l = "); write(l); enl;
    // printf("r = "); write(r); enl;
    // printf("res = "); write(v % d + l); enl;
    // system("pause");
    return v % d + l;
}
ll qpow(ll a, ll n, ll p) {
    ll res = 1;
    while (n) {
        if (n & 1)
            res = (lll)res * a % p;
        a = (lll)a * a % p;
        n >>= 1;
    }
    return res;
}
bool isPrime(ll x) {
    if (x < 3)return x == 2;
    if (x % 2 == 0)return false;
    ll A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022}, d = x - 1, r = 0;
    while (d % 2 == 0)
        d /= 2, ++r;
    for (auto a : A) {
        ll v = qpow(a, d, x);
        if (v <= 1 || v == x - 1)continue;
        for (int i = 0; i < r; ++i) {
            v = (__int128)v * v % x;
            if (v == x - 1 && i != r - 1) {
                v = 1;
                break;
            }
            if (v == 1)return false;
        }
        if (v != 1)return false;
    }
    return true;
}
inline ll mul(ll x, ll y, ll p) {
    ll r = (__float128)x / p * y;
    ll res = x * y - r * p;
    return (res + p) % p;
    // ll res = 0;
    // while (y) {
    //     if (y & 1) res = (res + x) % p;
    //     x = (x + x) % p;
    //     y >>= 1;
    // }
    // return res;
}

ll Pollard_Rho(ll N) {
    if (N == 1)return 1;
    if (N == 4)return 2;
    // if (isPrime(N))return 1;
    while (true) {
        ll c = randint<>((ll)1, N - 1);
        auto f = [=](ll x) {return (mul(x, x, N) + c) % N; };

        ll t = 0, r = 0, p = 1, q;
        do {
            for (int i = 0; i < 128; ++i) {
                t = f(t), r = f(f(r));
                if (t == r || (q = mul(p, abs(t - r), N) % N) == 0)break;
                p = q;
            }
            ll d = __gcd(p, N);
            if (d > 1)return d;
        } while (t != r);
    }
}
map<ll, ll>um;
ll max_prime_factor(ll x) {
    if (um.count(x))return um[x];
    ll fac = Pollard_Rho(x);
    if (fac == 1)um[x] = x;
    else um[x] = max(max_prime_factor(fac), max_prime_factor(x / fac));
    return um[x];
}

void solve() {
    lll n = read<lll>();
    // write(n);
    lll ans = Pollard_Rho(n);
    lll ans2 = n / ans;
    if (ans > ans2) swap(ans, ans2);
    write(ans), write(n / ans);
}
signed main(signed argc, char const* argv[]) {
    clock_t c1 = clock();
#ifdef LOCAL
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
    //=============================================================

    int TxT = 1;
    while (TxT--)
        solve();
    //=============================================================
#ifdef LOCAL
    end :
    cerr << "Time Used:" << clock() - c1 << "ms" << endl;
#endif
    return 0;
}