#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

ll N;
int main(){
    cin>>N;
    if(N%2&&N<=5) p(-1);
    else{
        int a,b;
        if(N%2==0){
            a = 1;
            b = N-1;
        }else{
            a = 6;
            b = N-6;
            if(a>b){
                swap(a,b);
            }
        }
        cout<<a<<" "<<b<<endl;
    }
    return 0;
}