#include <bits/stdc++.h> #define int long long using namespace std; void solve() { int n; cin >> n; vector <int> val(n); for (int i = 0; i < n; ++i) { cin >> val[i]; } vector <int> prev(n + 1, 0); for (int i = 0; i < n; ++i) { int v = log2(val[i] & (- val[i])); prev[i + 1] = prev[i] + (1LL << v); } int q; cin >> q; for (int i = 0; i < q; ++i) { int v; cin >> v; --v; int ind = upper_bound(prev.begin(), prev.end(), v) - prev.begin() - 1; v = log2(val[ind] & (- val[ind])); cout << (val[ind] >> v) << '\n'; } } signed main() { cin.tie(0); ios::sync_with_stdio(false); int t = 1; // cin >> t; for (int i = 0; i < t; ++i) { solve(); } }