#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <cmath>
#include <climits>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <functional>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0;a<b;a++)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(),a.end()
const int inf = 1e9;
const ll infl = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> licz(n);
rep(i, n){
cin >> a[i];
}
ll q;
cin >> q;
vector<ll> zap(q);
rep(i , q){
cin >> zap[i];
}
rep(i, n){
for(ll k = 30; k >= 0; k--){
if(a[i] % ll(1<<k) == 0){
licz[i] = (1<<k);
a[i] /= (1<<k);
break;
}
}
}
ll w = 0;
ll ind = -1;
rep(i, q){
while(w < zap[i]){
ind++;
w += licz[ind];
}
if(w < zap[i]){
ind++;
w += licz[ind];
}
cout << a[ind] << "\n";
}
return 0;
}
