#include <algorithm> #include <cassert> #include <cmath> #include <cstdio> #include <cstring> #include <iomanip> #include <iostream> #include <map> #include <memory> #include <numeric> #include <set> #include <stack> #include <string> #include <vector> #define rep(i, a, b) for (int i = (a); i < (b); ++i) #define all(x) (x).begin(), (x).end() #define MOD 1000000007 #define int long long using ll = long long; using namespace std; const int INF = 1LL << 50; using P = pair<int, int>; template <class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else { return false; } } template <class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else { return false; } } struct Setup { Setup() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); } } SETUP; vector<int> divisor(int n) { vector<int> res; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { res.push_back(i); if (i * i != n) res.push_back(n / i); } } sort(res.begin(), res.end()); return res; } signed main() { int n; cin >> n; auto ds = divisor(n); int len = ds.size(); if (len <= 2) { cout << n << " " << 1 << endl; } else { rep(i, 1, len) rep(j, 1, len) { if (ds[i] * ds[j] == n) { cout << ds[i] << " " << ds[j] << endl; } } } }