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

vector<int> SieveOfEratosthenes(int n) {
	n++;
	vector<bool> list(n, true);
	for(int i = 2; i * i < n; ++i) {
		if(list[i]){
			for(int j = 2; i * j < n; ++j) {
				list[i * j] = false;
			}
		}
	}
	vector<int> ret;
	for(int i = 2; i < n; ++i) {
		if(list[i]) ret.push_back(i);
	}
	return ret;
}


int f[2000010];
int main() {
	int x; cin >> x;
	int m;
	for(m = 1; m * m <= x; ++m);
	vector<int> v = SieveOfEratosthenes(m);
	int vn = v.size();
	for(int i = 1; i <= x; ++i) {
		int tmp = i;
		int cnt[vn] = {};
		for(int j = 0; j < vn; ++j) {
			while(tmp > 0 and tmp % v[j] == 0) {
				tmp /= v[j];
				++cnt[j];
			}
		}
		int d = 1;
		for(int j = 0; j < vn; ++j) {
			d *= (cnt[j] + 1);
		}
		f[i] = i - d;
	}
	int diff = 1e9;
	for(int i = 1; i <= x; ++i) {
		if(abs(f[i] - f[x - i]) < diff) {
			diff = abs(f[i] - f[x - i]);
		}
	}
	for(int i = 1; i <= x; ++i) {
		if(abs(f[i] - f[x - i]) == diff) {
			cout << i << " " << x - i << '\n';
		}
	}
	return 0;
}