#include "bits/stdc++.h"
using namespace std;
using ll = long long; using pii = pair<int, int>;
const int MOD = (int)1e9 + 7, INF = (1 << 27); const ll INFLL = (1LL << 55);
#define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
template<typename T, typename U> inline void chmax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> inline void chmin(T &x, U y) { if (x > y) x = y; }

ll n;
bool C(ll x) {
    ll a = 1;
    while (a <= x) {
        if (x == a) return true;
        a *= 2;
    }
    return false;
}

void solve(ll n) {
    for (ll i = 1; i <= n; i++) {
        if (i > n - i) break;
        if (!C(i) && !C(n - i)) {
            printf("%lld %lld\n", i, n - i);
            return;
        }
    }
    puts("-1");
}

int main() {
    //FOR(i, 1, 23) {
    //    solve(i);
    //}
    //solve(ll(1e18));
    ll n; cin >> n;
    solve(n);
    return 0;
}