#include <iostream>
#include <string>
#include <cstring>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_set>
#include <unordered_map>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

ll f[2100000], mi = INF;

ll IsPrime(ll n) {
	ll res = 0;
	for (ll i = 1; i <= sqrt(n); i++) {
		if (n % i == 0) {
			res++;
			if (n / i != i)res++;
		}
	}
	return res;
}
int main() {
	ll n;
	cin >> n;
	REPO(i, n) {
		f[i] = i - IsPrime(i);
	}
	REPO(i, n - 1) {
		mi = min(mi, abs(f[i] - f[n - i]));
	}
	REPO(i, n - 1) {
		if (abs(f[i] - f[n - i]) == mi) cout << i << " " << n - i << endl;
	}
}