#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <math.h>

using namespace std;

#define REP(i,n)	for(int i=0;i<(n);++i)
#define REPS(i,s,t)	for(int i=(s);i<(t);++i)

#define INF 		2000000007
#define MOD			1000000007
#define MAX 		100005


typedef unsigned int 			uint;
typedef unsigned long long int	ull;
typedef long long int ll;

//uint dp[MAX];

int bfs(int X,int n){
	if(X<=0)return INF;
	if(X==1) return n;

	if(X%2==0){
		return bfs(X/2,n+1);
	}
	else
		return bfs(X+1,n+1);
	return INF;
}

int main(){
	ull N;cin>>N;

	for(int i=3;i<=N/2;++i){
		ull b = N-i;
		if( ((i&(i-1))!=0) && ((b&(b-1))!=0) ){
			cout << i << " " << b << endl;
			return 0;
		}
	}
	cout << -1 << endl;

	return 0;
}