#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
void solve(){
int n;
cin >> n;
vector<ll> a(n+1), cnt(n+1, 1), pf(n+2, 0);
for(int i = 1; i <= n; i++){
cin >> a[i];
while(a[i]%2 == 0){
cnt[i]*=2;
a[i]/=2;
}
}
for(int i = 1; i <= n; i++){
pf[i] = pf[i-1]+cnt[i];
}
pf[n+1] = INF;
int q;
cin >> q;
for(int i = 1; i <= q; i++){
ll x;
cin >> x;
int p = lower_bound(pf.begin()+1, pf.end(), x) - pf.begin();
cout << a[p] << "\n";
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
