#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define nl "\n"
#define all(x) (x).begin(), (x).end()
#define Yes cout<<"Yes"<<"\n";
#define No  cout<<"No"<<"\n"; 
void run(int t){
    int n, q;
    cin >> n;
    vector<int> a(n);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> minHeap;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        minHeap.push({a[i], i});
    }
    cin >> q;
    while(q--){
        int X;
        cin >> X;
        while(!minHeap.empty() && minHeap.top().first != a[minHeap.top().second]){
            minHeap.pop();
        }
        int minPos = minHeap.top().second;
        cout << (minPos + 1) << nl;
        a[minPos] = X;
        minHeap.push({X, minPos});
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin >> t;
    int c  = 1;
    while(t--){
        //cout << "Case " << c++ << ": ";
        run(t);
    }
    return 0;
}