#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using edge = struct
{
    int to;
    int cost;
};

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

ll N;

bool check(ll x)
{
    return (x & x - 1) == 0;
}

int main()
{
    cin >> N;
    for(int i = 3; i < min(N, 10LL); i++)
    {
        if(!check(i) && !check(N - i))
        {
            cout << i << " " << N - i << endl;
            return 0;
        }
    }

    cout << -1 << endl;
    return 0;
}