#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define sz(x) (int)x.size()
const char nl = '\n';
const int mod = 998244353;
const int N = 2e5+10;
vector<int> p;
void solve() {
int n; cin >> n;
vector<int> a(n); p.resize(n);
rep(i, 0, n) {
int x; cin >> x;
int cnt = 0;
while (x%2 == 0) {
x /= 2,
cnt += 1;
}
a[i] = x,
p[i] = (1<<cnt)+(i?p[i-1]:0);
}
int q; cin >> q;
while(q--) {
int x; cin >> x;
auto lb = lower_bound(all(p), x) - p.begin();
//cout << lb << nl;
cout << a[lb] << nl;
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
