#include <bits/stdc++.h>
using namespace std;
int main(){
//didn't a very similar problem come out for codeforces before? but actually this is easier :p
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
long long cake[n];
for (int x = 0; x < n; x++) cin >> cake[x];
vector<pair<long long, long long>> decomp;
long long carry = 0;
for (int x = 0; x < n; x++){
long long woof = cake[x], meow = 1;
while (woof % 2 == 0){
woof /= 2; meow *= 2;
}
carry += meow;
decomp.push_back(make_pair(carry, woof));
}
int q; cin >> q; long long temp;
//lazy binsearch shld pass
for (int y = 0; y < q; y++){
cin >> temp;
cout << lower_bound(decomp.begin(), decomp.end(), make_pair(temp,0LL))->second << '\n';
}
}
