#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<ll,ll>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

P f(ll n){
    if(n > 10){
        if(__builtin_popcountll(n - 3) != 1){
            return std::make_tuple(3, n - 3);
        }else{
            return std::make_tuple(5, n - 5);
        }
    }

    for(int i=3;i<n;++i){
        int j = n - i;
        if(__builtin_popcount(i) != 1 &&
           __builtin_popcount(j) != 1){
            return std::make_tuple(i, j);
        }
    }

    return std::make_tuple(-1, -1);
}

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

    ll N;
    std::cin >> N;

    ll a, b;
    tie(a, b) = f(N);

    if(a == -1){
        std::cout << -1 << std::endl;
    }else{
        std::cout << a << " " << b << std::endl;
    }
}