#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
void test_case() {
int n; cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
vector<ll> pref(n);
for (int i = 0; i < n; i++) {
pref[i] = (1 << __builtin_ctz(a[i])) + (i ? pref[i-1] : 0);
}
int q; cin >> q;
while (q--) {
ll pos; cin >> pos;
int who = lower_bound(all(pref), pos) - pref.begin();
cout << (a[who] >> __builtin_ctz(a[who])) << '\n';
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t = 1;
// cin >> t;
while (t--) test_case();
}
