#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n;
    cin>>n;
    vector<int> arr(n);
    set<pair<int,int>> s;  
    
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        s.insert({arr[i], i}); 
    }

    int q;
    cin >> q;
    while (q--) {
        int x;
        cin >> x;

        auto minElem=*s.begin();  
        int minPos=minElem.second;

        cout << minPos + 1 << endl;  

        s.erase(s.begin());
        s.insert({x, minPos});
        arr[minPos] = x;
    }

    return 0;
}