#include <iostream>
#include <cmath>
using namespace std;

int main(int argc, const char * argv[]) {
    long long N; cin >> N;
    
    bool findNum = false;
    long long top = 0; long long bottom = 0;
    for(long long i = 1; i <= N/2; i++) {
        top = i; bottom = N - i;
        double res1 = log2(top) - (long long)(log2(top));
        double res2 = log2(bottom) - (long long)(log2(bottom));
        if (res1 != 0 && res2 != 0) {
            findNum = true;
            break;
        }
    }
    if(findNum) {
        cout << top << " " << bottom << endl;
    } else {
        cout << "-1" << endl;
    }

    return 0;
}