#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

vector<int> primes;

int d(int y){
	int t = y;
	map<int, int> mp;
	for(int p : primes){
		if(p > t) break;
		while(t % p == 0){
			if(mp.count(p) == 0) mp[p] = 0;
			mp[p]++;
			t /= p;
		}
	}

	int ret = 1;
	for(auto q : mp){
		ret *= (1 + q.second);
	}

	if(t > 1) ret *= 2;
	// cout << "d(" << y << ") = " << ret << endl;
	return ret;
}

int f(int y){
	return y - d(y);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int x;
	cin >> x;

	vector<int> isprime(x+1, true);
	isprime[0] = false;
	isprime[1] = false;

	for(int i = 2; i <= x; i++){
		if(isprime[i]){
			for(int j = 2 * i; j <= x; j += i) isprime[j] = false;
		}
	}

	for(int i = 2; i * i <= x; i++){
		if(isprime[i]) primes.push_back(i);
	}

	vector<int> v;
	int mn = x;

	for(int i = 1; i < x; i++){
		int t = abs(f(i) - f(x - i));
		if(t < mn){
			mn = t;
			v.clear();
			v.push_back(i);
		}else if(t == mn){
			v.push_back(i);
		}
	}
	
	for(int y : v){
		cout << y << " " << x - y << endl;
	}
}