#include<bits/stdc++.h>
using namespace std;

void solve(){
  using ll=long long;
  int bit=40;
  ll n;
  cin>>n;
  ll nn=n;
  int p=__popcount(n);
  int s=p;
  for (int i=0;i<40;i++){
    if ((n>>i)&1){
      s--;
      n^=(1LL<<i);
    }
    if (s<=p-2&&!((n>>(i+1))&1)){
      n^=1LL<<(i+1);
      cout<<n-nn<<endl;
      return;
    }
  }
  cout<<-1<<endl;
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}