#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(),x.end()
#define ln '\n'
const long long MOD = 1000000007LL;
//const long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull; 
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int X; cin >> X;
    vector<int> A(X+1);
    iota(all(A),0);
    for (int i = 1; i <= X; ++i) {
        for (int j = 1; j*i <=X; ++j) {
            A[i*j]--;
        }
    }

    int val = 1e9;
    map<int, int> dic;
    for (int i = 1; i < X; ++i) {
        if (val > abs(A[i] - A[X-i])) {
            val = abs(A[i] - A[X-i]);
            dic.clear();
            dic.emplace(i,X-i);
        } else if (val==abs(A[i] - A[X-i])) {
            dic.emplace(i,X-i);
        }
    }

    for (auto i : dic) {
        cout << i.first << " " << i.second << ln;
    }
}