#include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
#define vi vector<int>
#define IP pair<int,P>
#define PI pair<P,int>
#define PP pair<P,P>
#define Yes(f){cout<<(f?"Yes":"No")<<endl;}
#define YES(f){cout<<(f?"YES":"NO")<<endl;}
int Madd(int x,int y) {return (x+y)%M;}
int Msub(int x,int y) {return (x-y+M)%M;}
int Mmul(int x,int y) {return (x*y)%M;}

int n;
int  ans=inf;

int bitcount(int n){
  int res=0;
  while(n){
    res+=(n&1);
    n>>=1;
  }  
  return res;
}

void f(int a,int k){
  if(a>=n) return;
  if(a>ans) return;
  if(k>60) return;

  //cout<<a<<' '<<k<<endl;
  int b=n-a;
  if(bitcount(a)>1&&bitcount(b)>1) ans=min(ans,a);

  f(a,k+1);
  f(a+(1LL<<k),k+1);
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(20);

  cin>>n;

  f(0,0);

  if(ans==inf) cout<<-1<<endl;
  else cout<<ans<<' '<<n-ans<<endl;

}