#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second
int32_t main(){
int n, a, q;
cin>>n;
vector<pii> vect(n);
for (int i=0; i<n; ++i){
int c=1;
cin>>a;
while (!(a%2))c*=2, a/=2;
vect[i]=mp(c, a);
}
for (int i=1; i<n; ++i)vect[i].fi+=vect[i-1].fi;
cin>>q;
while (q--){
cin>>a;
cout<<(*(lower_bound(vect.begin(), vect.end(), mp(a, 0ll)))).se<<"\n";
}
}
