#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 200005
int A[MAX];
int nArr, numQuery;
void process(void){
cin >> nArr;
for (int i = 1; i <= nArr; ++i) cin >> A[i];
cin >> numQuery;
vector<int> val;
for (int i = 1; i <= nArr; ++i){
if (A[i] & 1){
val.emplace_back(!val.empty() ? val.back() + 1 : 1);
}
else{
int k = 0;
while (A[i] % 2 == 0){
A[i] /= 2; k++;
}
val.emplace_back(!val.empty() ? val.back() + MASK(k) : MASK(k));
}
}
for (int i = 1; i <= numQuery; ++i){
int x; cin >> x;
auto pos = lower_bound(val.begin(), val.end(), x) - val.begin() + 1;
cout << A[pos] << '\n';
}
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
