#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 100100100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

ll n;

bool check(ll x) {
    while (x % 2 == 0) {
        x /= 2;
    }
    return x == 1;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> n;
    ll a = 0, b = 0;
    rep(i, 3, min(n, 10LL)) {
        if (!check(i) && !check(n-i)) {
            a = i, b = n - i;
            cout << a << " " << b << endl;
            return 0;
        }
    }
    cout << -1 << endl;
    return 0;
}