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

int main() {
    int n;
    cin>>n;
    vector<int> arr(n);
    for (int i = 0; i < n; ++i)cin>>arr[i];

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

        int minPos = min_element(arr.begin(),arr.end())-arr.begin();
        cout << minPos + 1 << endl;
      
        arr[minPos] = x;
    }

    return 0;
}