#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    int32_t a = 1, b = 1;
    for (auto i = 2; i * i <= n; ++i) {
        int32_t c = 0;
        while (n % i == 0) {
            ++c;
            n /= i;
        }
        if (c % 2 == 1) {
            b *= i;
            --c;
        }
        for (auto j = 0; j < c / 2; ++j) {
            a *= i;
        }
    }
    b *= n;
    cout << a << " " << b << endl;
    return 0;
}