#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int X;
	cin >> X;
	
	auto f = [](int x) {
		int res = 0;
		for (int i = 1; i * i <= x; ++i) if (x % i == 0) {
			res += 2;
			if (i * i == x) --res;
		}
		return x - res;
	};
	
	constexpr int sqrt = 1500;
	int mn = INF;
	vector<int> ans;
	FOR(i, 1, X) {
		const int j = X - i;
		if (abs(i - j) > sqrt + 1) continue;
		const int cur = abs(f(i) - f(j));
		if (mn < cur) continue;
		if (chmin(mn, cur)) ans.clear();
		ans.emplace_back(i);
	}
	for (int i : ans) printf("%d %d\n", i, X - i);
}