#include <iostream>
#include <algorithm>
#include <cmath>
#define rep(i, a, n) for(int i = a;i < n;i++)
using namespace std;


int n;


bool judge(int a){
	return !(log2(a) - (int)log2(a) < 0.0000001);
}


int solve(){
	rep(a, 1, n){
		int b = n - a;
		if(judge(a) && judge(b)) return a;
	}
	return -1;
}


int main(){
	cin >> n;

	/*int a = solve();

	if(a == -1) cout << a << endl;
	else cout << min(a, n-a) << ' ' << max(a, n-a) << endl;*/

	while(1){ ; }

	return 0;
}