#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl '\n'
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int mxn = 1e6 + 123;
int a[mxn],b[mxn];
void solve(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	priority_queue<pair<int,int>>pq;
	for(int i=1;i<=n;i++){
		pq.push({-a[i],i});
	}
	int q;
	cin>>q;
	while(q--){
		int u;
		cin>>u;
		auto x=pq.top();
		pq.pop();
		cout<<x.second<<endl;
		pq.push({-u,x.second});
	}
} 
signed main() {
    fastio;
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}