#include <iostream>
#include <set>
using namespace std;
int main(){
    unsigned long long n;cin>>n;
    set<unsigned long long> nya;
    unsigned long long nw = 1;
    nya.insert(nw);
    while(n > nw){
        nw *= 2;
        nya.insert(nw);
    }
    for(long long i = 3; n > i; i++){
        if(nya.find(i) != nya.end())continue;
        if(nya.find(n-i) != nya.end())continue;
        cout << i << " " << n-i << endl;
        return 0;
    }
    cout << -1 << endl;
    
    
    
}