#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

signed main(){
	cout<<fixed<<setprecision(10);
	
	int X, minimum = INF;
	vector<pair<int,int>> ans;
	vector<int> div;
	
	cin>>X;
	
	div.resize(X+1);
	
	for(int i = 1; i <= X; i++){
		for(int j = i; j <= X; j += i){
			div[j]++;
		}
	}
	
	for(int i = 1; i < X; i++){
		int a = i, b = X - i;
		
		a = a - div[a];
		b = b - div[b];
		
		if(abs(a - b) < minimum) {
			minimum = abs(a - b);
		}
	}
	
	for(int i = 1; i < X; i++){
		int a = i, b = X - i;
		
		a = a - div[a];
		b = b - div[b];
		
		if(abs(a - b) ==  minimum) {
			ans.push_back({i,X-i});
		}
	}
	
	sort(ans.begin(), ans.end());
	
	for(int i = 0; i < ans.size(); i++){
		cout<<ans[i].first<<" "<<ans[i].second<<endl;
	}
	
	return 0;
}