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

typedef long long ll;
typedef double dl;

#define endl "\n"
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);

int main()
{
    optimize();

        int n;

        cin >> n;

        vector <int> ar(n);

        for(int i = 0; i < n; i++)   cin >> ar[i];

        vector<int> mnn(n);

        for(int i = 0; i < n; i++)  mnn[i] = ar[i];

        map <int , int> cnt;

        for(int i = 0; i < n; i++)  {
                cnt[ar[i]] = i+1;
        }

        sort(mnn.begin(), mnn.end());

        int q;

        cin >> q;

        int mn = 0;

        while(q--){
            int tmp;

            cin >> tmp;

            int ans = cnt[mnn[mn]];

            cout << ans << endl;

            ar[ ans-1 ] = tmp;

            if(tmp < mnn[mn+1]){
                cnt[mnn[mn+1]] = ans;
            }

            mn++;
        }

    return 0;
}