#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int a[1<<18], Ans[1<<18],n, q;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin>>n;
for (int i=1;i<=n;i++)
cin>>a[i];
cin>>q;
vector<pair<int,int>> vec;
for (int i=1, vl;i<=q;i++){
cin>>vl;
vec.push_back({vl, i});
}
sort(begin(vec), end(vec));
for (int i=1, pre = 0, id = 0;i<=n;i++){
int k = 1;
while (a[i] % 2 == 0)
a[i] /= 2, k *= 2;
pre += k;
while (id < vec.size() and vec[id].first <= pre)
Ans[vec[id++].second] = a[i];
}
for (int i=1;i<=q;i++)
cout<<Ans[i]<<' ';
cout<<'\n';
}
