#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N;
    cin >> N;
    vector<ll> pow2(62, 1);
    for(int i = 1; i < 62; ++i) pow2[i] = pow2[i - 1] * 2;
    for(ll i = 3; i <= N / 2; ++i){
        if(*lower_bound(begin(pow2), end(pow2), i) == i)    continue;
        if(*lower_bound(begin(pow2), end(pow2), N - i) == N - i)    continue;
        cout << i << ' ' << N - i << '\n';
        return 0;
    }
    cout << -1 << endl;

    return 0;
}