#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
  int x;
  cin >> x;
  vector<int> d(x + 1, 0);
  for (int i = 1; i <= x; i++) {
    for (int j = i; j <= x; j += i) d[j]++;
  }
  
  int res = INF;

  for ( int i = 1; i < x; i++) {
    int j = x - i;
    int fa = i - d[i], fb = j - d[j];
    res = min(res, abs(fa - fb));
  }

  for ( int i = 1; i < x; i++) {
    int j = x - i;
    int fa = i - d[i], fb = j - d[j];
    if (abs(fa - fb) == res) cout << i << " " << j << endl;
  }
  return 0;
}