#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <algorithm> #include <array> #include <bitset> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef vector<VL> VVL; typedef pair<int,int> P; typedef pair<ll,ll> PL; typedef vector<double> VD; int main() { set<ll> st; REP(i,64){ st.insert(1LL << i); } ll n; cin >> n; for (int x = 1; x < n-1; x++){ if (st.count(x) + st.count(n - x) == 0){ cout << x << " " << n - x << endl; return 0; } } cout << -1 << endl; return 0; }