#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

ll N;
bool C(ll x) {
    while (x > 1) {
        if (x % 2 == 1) return true;
        x /= 2;
    }
    return false;
}
int main(){
    cin>>N;
    REP(i,3,min(N,10LL)){
        if(C(i)&&C(N-i)){
            cout<<i<<" "<<N-i<<endl;
            return 0;
        }
    }
    p(-1);
    return 0;
}