#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>

static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;


int main() {
    map<ll, int> v;
    for (int i = 0; i <= 60; ++i) {
        v[1LL<<i]++;
    }
    ll n;
    cin >> n;
    for (ll i = 3; i <= min((ll)n-1, 1000L); ++i) {
        if(!v[i] && !v[n-i]) {
            printf("%li %li\n", i, n-i);
            return 0;
        }
    }
    puts("-1");
    return 0;
}