#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
#include <assert.h>
#include <cstddef>
#include <algorithm>
#include <functional>
#include <iterator>
#include <type_traits>
#include <vector>
#include <numeric>

using namespace std;


map<long long, int> primeFactorDecomposition(long long n) {
    map<long long, int> m;
    while (n > 1) {
        bool findFactor = false;
        for (long long i = 2; i * i <= n; ++i) {
            if (n % i == 0) {
                m[i]++;
                n /= i;
                findFactor = true;
                break;
            }
        }
        if (!findFactor) {
            m[n]++;
            break;
        }
    }
    return m;
}

int main() {
    long long n;
    cin >> n;

    map<long long, int> m = primeFactorDecomposition(n);
    if (m.size() == 0) {
        cout << 1 << " " << n << endl;
    }
    else {
        for (auto p : m) {
            long long a = p.first;
            long long b = n / a;
            cout << a << " " << b << endl;
            break;
        }
    }
    
    return 0;
}