#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll x;
    cin >> x;
    vector<ll> cnt(x + 1);
    rep(i, x + 1) cnt[i] = i;
    reps(i, 1, x + 1) {
        for(ll j = i; j <= x; j += i) {
            cnt[j]--;
        }
    }
    ll mv = LONG_LONG_MAX;
    set<pair<ll, ll>> s;
    reps(i, 1, x) {
        ll j = x - i;
        ll d = abs(cnt[i] - cnt[j]);
        if (mv > d) {
            mv = d;
            s.clear();
            s.insert(make_pair(i, j));
        }
        else if (mv == d) {
            s.insert(make_pair(i, j));
        }
    }
    for(auto p : s) {
        printf("%lld %lld\n", p.first, p.second);
    }
    return 0;
}