#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

int const MAX_N = 2000;
vector<ll> prime;
vector<bool> is_prime(MAX_N,true);
void Eratosthenes() {
    is_prime[0] = is_prime[1] = false;
    for (ll i = 2;i*i < MAX_N;++i) if (is_prime[i]) for (ll j = 2*i;j < MAX_N;j += i) is_prime[j] = false;
    for (ll i = 0;i < MAX_N;++i) if (is_prime[i]) prime.push_back(i);
}

int main() {
    Eratosthenes();
    int x;
    cin >> x;
    vector<int> a(x+1,1);
    for (int i = 1;i < x+1;++i) {
        int j = i;
        for (ll& p : prime) {
            if (p*p > j) break;
            if (j%p) continue;
            int cnt = 1;
            while (j%p == 0) j /= p,cnt++;
            a[i] *= cnt;
        }
        if (j > 1) a[i] *= 2;
    }
    int mn = 1e9;
    for (int i = 1;i < x/2+1;++i) mn = min(mn,abs((i-a[i])-(x-i-a[x-i])));
    for (int i = 1;i < x+1;++i) if (abs((i-a[i])-(x-i-a[x-i])) == mn) cout << i << " " << x-i << "\n";
}