#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int x; cin >> x;
  vector<int> d(x, 1);
  FOR(i, 2, x) {
    for (int j = i; j < x; j += i) ++d[j];
  }
  FOR(i, 1, x) d[i] = i - d[i];
  int ans = INF;
  vector<pair<int, int> > ab;
  FOR(a, 1, x) {
    int b = x - a, dif = abs(d[a] - d[b]);
    if (dif < ans) {
      ans = dif;
      ab.clear();
      ab.emplace_back(a, b);
    } else if (dif == ans) {
      ab.emplace_back(a, b);
    }
  }
  for (auto pr : ab) cout << pr.first << ' ' << pr.second << '\n';
  return 0;
}