#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main(){
    ll n;
    cin>>n;
    vector<ll> v;
    ll t=1;
    while(t<=1e18){
        v.pb(t);
        t*=2;
    }
    for(ll i=1;i<n;i++){
        if(find(all(v),i)==v.end()&& find(all(v),n-i)==v.end()){
            cout<<i<<" "<<n-i<<endl;
            return 0;
        }
    }
    cout<<-1<<endl;
    
    
    return 0;
}