#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

bool is2pow( long long a ) {
    int cnt = 0;
    for ( int i = 0; i < 32; i++ ) {
        if ( (1<<i)&a ) { cnt++; }
    }

    return cnt == 1;
}

int main() {
    long long N;
    cin >> N;
    for ( long long i = 3; i < N; i++ ) {
        if ( !is2pow(i) && !is2pow(N-i) ) {
            cout << i << " " << N-i << endl;
            return 0;
        }
    }
    cout << -1 << endl;

    return 0;
}