#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("6in.txt" , "r" , stdin);
#define outF freopen("6.txt" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long
//#define int ll
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
const int N = 1e3 + 5 , M = N * 64 , MX = 2e4 + 40;
const ll MOD = 1e9 + 7 , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;
int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , -1 , 1};
int n , m ;
// cin >> n >> m ;
int32_t main()
{ //inF;
//inF;outF;
fastio;
int n ;
cin >> n ;
vector<int> v(n);
for(auto &it : v)cin >> it ;
int q ;
cin >> q ;
vector<pair<ll , int> > Q (q);
for(int i = 0 ; i < q ; i ++){
ll a ;
cin >> a ;
Q[i] = {a, i};
}
sort(Q.begin() ,Q.end());
int p = 0 ;
ll sum = 0;
int ans[q] = {};
for(int i = 0 ; i < n && p < q;i ++){
ll cnt = 1 , number = v[i];
while(number % 2 == 0)cnt *=2 , number /= 2 ;
sum += cnt ;
while(p < q && Q[p].first <= sum)ans[Q[p].second] = number , p ++ ;
}
for(int i = 0 ; i < q ; i ++)cout << ans[i] << "\n" ;
}
