#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    int cnt[n+1]={};
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j+=i){
            cnt[j]++;
        }
    }
    int val[n+1];
    for(int i=1;i<=n;i++){
        val[i]=i-cnt[i];
    }

    vector<pair<int,int>> ans;
    int score=INF;
    for(int i=1;i<=n;i++){
        int j=n-i;
        chmin(score,abs(val[i]-val[j]));
    }
    for(int i=1;i<=n;i++){
        int j=n-i;
        if(score==abs(val[i]-val[j])) ans.push_back(make_pair(i,j));
    }
    for(auto p:ans){
        cout<<p.first<<" "<<p.second<<endl;
    }
    return 0;
}