//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ALL(x) x.begin(), x.end()
#define vi vector<int>
#define CASE int t; cin >> t; for(int ca=1;ca<=t;ca++)
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int MAX = 1 << 20, MOD = 1e9 + 7;
void solve(){
int n;
cin >> n;
vector<pii> v;
for(int i = 0;i < n;i++){
int a, t;
cin >> a;
t = a;
while(t % 2 == 0){
t /= 2;
}
v.PB({t, a / t});
}
int q;
cin >> q;
ll now = 0, sum = v[0].S;
while(q--){
ll x;
cin >> x;
while(sum < x){
now++;
sum += v[now].S;
}
cout << v[now].F << '\n';
}
}
int main(){
IOS
solve();
return 0;
}
