#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;

long long N;
long long exp_2[61] = {};    // log2(10 ** 18) + 1 ≒ 61

void init() {
  long long s = 1;
  int i = 0;
  while (s <= N) {
    exp_2[i] = s;
    s *= 2;
    ++i;
  }
}

bool is_exp_2(long long n) {
  if (exp_2[0] == 0) init();
  int left = 0, right = log2(N) + 1;
  while (left < right) {
    int mid = (left + right) / 2;
    if (n == exp_2[mid]) return true;
    else if (n < exp_2[mid]) right = mid;
    else left = mid + 1;
  }
  return false;
}

int main() {
  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;
}