#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(20);
}

#define int ll
int d[3000000];
int f(int x) {
    return x - d[x];
}
void solve() {
    for (int i = 1; i <= 2e6; ++i) {
        for (int q = 1; q * i <= 2e6; ++q) {
            d[i * q]++;
        }
    }
    int x;
    cin >> x;
    vector<tuple<int, int, int>> inputs;
    REP(i, x-1) {
        inputs.push_back(make_tuple((long long)abs(f(i + 1) - f(x - i - 1)), i + 1,x - i - 1));
    }
    sort(ALL(inputs));
    REP(i, inputs.size()) {
        if (get<0>(inputs[i]) != get<0>(inputs[0])) break;
        cout << get<1>(inputs[i]) << " " << get<2>(inputs[i]) << endl;
    }
}

#undef int
int main() {
    init();

    solve();
}