#include <bits/stdc++.h>
// #pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 9e3+20;
const ll INF = 1e9+10;
const int LOG = 20;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
vector <int> key = {29, 31};
vector <int> mod = {998244353, 1000000007};
void chmx(int &a, int b){ a = max(a, b); }
int n, a[MAXN], pr[MAXN];
pii val[MAXN];
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i=1; i<=n; i++){
cin >> a[i];
int tot = 0;
while((a[i]&1) == 0){ tot++; a[i] >>= 1; }
val[i] = {(1ll<<tot), a[i]};
pr[i] = pr[i-1]+(1ll<<tot);
}
int q; cin >> q;
for(int i=1; i<=q; i++){
int x; cin >> x;
int l=1, r=n, mid=0, cnt=0;
while(l<=r){
mid = md;
if(pr[mid] >= x){
r = mid-1; cnt = mid;
} else l = mid+1;
}
cout << val[cnt].se << '\n';
}
}
