#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=1e9+7 ;


int cnt[2][2];
int main(){
	int n;
	cin>>n;
	vector<int> ans(n+1);
	rep(i,n)ans[i+1]=i+1;
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j+=i)ans[j]--;
	}
	vector<int> ret;
	int res = inf;
	for(int i=1;i<n;i++){
		int t = abs(ans[i]-ans[n-i]);
		if(t<res){
			ret.clear();
			res = t;
		}
		if(t==res)ret.push_back(i);
	}
	for(auto e:ret){
		cout<<e<<" "<<n-e<<endl;
	}
	return 0;
}