#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<vector>

 #include<map>

 #define ll long long

 #define inf 2139062143

 #define MAXN 1001000

 using namespace std;

 inline ll read()

 {

     ll x=,f=;char ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) x=x*+ch-'',ch=getchar();

     return x*f;

 }

 ll n,a[MAXN],T,sum[MAXN],mn[MAXN][],mx[MAXN][];

 int main()

 {

     n=read();ll x,res;

     for(ll i=;i<=n;i++) a[i]=read();

     sort(a+,a+n+);

     for(ll i=;i<=n;i++) sum[i]=sum[i-]+a[i];

     for(ll i=;i<=n;i++) mx[i][a[i]&]=a[i],mx[i][(a[i]&)^]=mx[i-][(a[i]&)^];

     mn[n+][]=mn[n+][]=inf;

     for(ll i=n;i>=;i--) mn[i][a[i]&]=a[i],mn[i][(a[i]&)^]=mn[i+][(a[i]&)^];

     T=read();

     while(T--)

     {

         x=read();

         res=sum[n]-sum[n-x];

         if(res&) {printf("%lld\n",res);continue ;}

         res=-;

         if(mn[n-x+][]!=inf&&mx[n-x][]) res=sum[n]-sum[n-x]-mn[n-x+][]+mx[n-x][];

         if(mn[n-x+][]!=inf&&mx[n-x][]) res=max(res,sum[n]-sum[n-x]-mn[n-x+][]+mx[n-x][]);

         printf("%lld\n",res);

     }

 }