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

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

    return 0;
}