#include <bits/stdc++.h>

using ll = long long;
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    cin >> n;

    if (!n)
        return 0;

    ll t{ n },pf{ 2 };

    unordered_map<ll, int> m;

    while (t >= pf * pf)
    {
        if (!(t % pf))
        {
            ++m[pf];
            t /= pf;
        }
        else
        {
            ++pf;
        }
    }

    ++m[t];

    ll minv{ n };
    bool b{ false };
    for (auto i : m)
    {
        if ((i.second & 1) && (i.first < minv))
            minv = i.first;

        if (!(i.second & 1))
            b = true;
    }

    if (minv != n)
    {
        if (b)
            cout << sqrt(n / minv) << " " << minv << "\n";
        else
            cout << 1 << " " << n << "\n";
    }
    else
        cout << n  << " " << 1 << "\n";

    return 0;
}