#include using namespace std; typedef long long ll; typedef long double ld; typedef pair pll; typedef pair pli; typedef pair pii; typedef pair pld; typedef pair ppiii; typedef pair ppiil; typedef pair pplll; typedef pair pplii; typedef vector> vvl; typedef vector> vvi; typedef vector> vvpll; #define rep(i, a, b) for (ll i=(a); i<(b); i++) #define rrep(i, a, b) for (ll i=(a); i>(b); i--) #define pb push_back #define tostr to_string #define mkp make_pair const ll INF = 1e18; const ll MOD = 1e9 + 7; void print(ld out) { cout << fixed << setprecision(12) << out << '\n'; } template void print(T out) { cout << out << '\n'; } template void print(pair out) { cout << out.first << ' ' << out.second << '\n'; } template void print(vector A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } } template void print(set S) { vector A(S.begin(), S.end()); print(A); } template inline bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; } template inline bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; } ll sum(vector A) { ll res = 0; for (ll a: A) res += a; return res; } ll max(vector A) { ll res = -INF; for (ll a: A) chmax(res, a); return res; } ll min(vector A) { ll res = INF; for (ll a: A) chmin(res, a); return res; } ll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; } int toint(char c) { return c - '0'; } char tochar(int i) { return '0' + i; } inline ll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; } inline ll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; } inline ll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } } inline ll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } } int popcount(ll S) { return __builtin_popcountll(S); } ll gcd(ll a, ll b) { return __gcd(a, b); } ll N; ll divs[2000007]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N; ll cur; rep(i, 1, N+1) { cur = i; while (cur <= N) { divs[cur]++; cur += i; } } ll i, j, a, b, dist, mn = INF; vector ans; rep(i, 1, N) { j = N - i; if (i >= j) break; a = i - divs[i]; b = j - divs[j]; dist = abs(a-b); if (dist < mn) { ans = {mkp(i, j), mkp(j, i)}; mn = dist; } else if (dist == mn) { ans.pb(mkp(i, j)); ans.pb(mkp(j, i)); } } if (N % 2 == 0) { dist = 0; i = j = N / 2; if (dist < mn) { ans = {mkp(i, j)}; mn = dist; } else if (dist == mn) { ans.pb(mkp(i, j)); } } sort(ans.begin(), ans.end()); for (auto p : ans) { print(p); } return 0; }