#include <bits/stdc++.h> using namespace std; typedef long long ll; int n, q; ll a[200002]; ll val[200002]; ll cnt[200002]; int main(){ ios_base::sync_with_stdio(false), cin.tie(nullptr); cin >> n; for(int i=1; i<=n; i++){ cin >> a[i]; ll tmp = a[i]; while(tmp%2==0){ tmp /= 2; } val[i] = tmp; cnt[i] = a[i]/tmp + cnt[i-1]; } cin >> q; while(q--){ ll x; cin >> x; ll h = lower_bound(cnt+1, cnt+n+1, x) - cnt; cout << val[h]<< '\n'; } }