#include<bits/stdc++.h>
using namespace std;
typedef long long ll;


signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);

    int n;
    cin>>n;
    int x[n+1]={};
    vector<int> p;
    bool prime[n+1]={};
    for(int i=2;i*i<=n;i++){
        if(prime[i]==0){
            for(int j=i+i;j<=n;j+=i){
                prime[j] = 1;
            }
        }
    }
    prime[0]=prime[1]=1;
    for(int i=0;i<=n;i++){
        if(prime[i]==0){
            p.push_back(i);
        }
    }
    for(int val=1;val<=n;val++){
        int ret = 1;
        for(auto i:p){
            int t = val;
            int cnt = 0;
            while(t%i==0){
                t/=i;
                cnt++;
            }
            ret *= (cnt+1);
        }
        x[val] = val-ret;
    }
    int ans = 11111110;
    for(int i=1;i<n;i++){
        ans = min(ans,abs(x[i]-x[n-i]));
    }
    for(int i=1;i<n;i++){
        if(abs(x[i]-x[n-i]) == ans){
            cout << i << " " << n-i << "\n";
        }
    }
    
}