#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
using namespace std;

vector<int> exp_2;
int candidate[121];

bool is_exp_2(int n) {
  long long a = 1;
  while (a <= n) {
    if (a == n) return true;
    a *= 2;
  }
  return false;
}

int main() {
  long long N;
  cin >> N;

  if (N <= 122) {
    int a, b;
    rep1(i, N - 1) {
      a = i;
      b = N - a;
      if (!is_exp_2(a) && !is_exp_2(b)) {
        cout << a << " " << b << endl;
        return 0;
      }
    }
    cout << -1 << endl;
    return 0;
  }

  long long a, b;
  rep1(i, 121) {
    a = i;
    b = N - a;
    if (!is_exp_2(a) && !is_exp_2(b)) {
      cout << a << " " << b << endl;
      return 0;
    }
  }

  return 0;
}