/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using minheap = priority_queue<long long, vector<long long>, greater<long long>>;
typedef tree<int, null_type, greater_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key

#define ll long long
#define ld long double
#define MOD 1000000007
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl '\n'
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define life_is_a_race ios::sync_with_stdio(false); cin.tie(nullptr);

pair<int,int> sg[400005];
int a[100005];

void build(int node,int start,int end)
{
    if(start == end)
    {
        sg[node] = {a[start],start};
        return;
    }

    int mid = (start + end) / 2;
    build(node*2,start,mid);
    build(node*2+1,mid+1,end);
    if(sg[node*2] <sg[node*2+1]) sg[node] = sg[node*2];
    else sg[node] = sg[node*2+1];
}

void update(int node,int start,int end,int ind,int val)
{
    if(start == end)
    {
        sg[node] = {val,start};
        return;
    }
    int mid = (start + end)/2;
    if(ind <= mid) update(node*2,start,mid,ind,val);
    else update(node*2+1,mid+1,end,ind,val);
    if(sg[node*2] <sg[node*2+1]) sg[node] = sg[node*2];
    else sg[node] = sg[node*2+1];
}


void solve(int tc)
{
    //cout<<"Case "<<tc<<": ";
    int n; cin >> n;
    for(int i=0;i<n;i++) cin >> a[i];
    build(1,0,n-1);
    int q; cin >>q;
    while(q--)
    {
        int x ; cin >> x;
        pair<int,int> p = sg[1];
        cout << p.second+1 << endl;
        update(1,0,n-1,p.second,x);
    }
}
int main()
{
    life_is_a_race
    int t=1; 
    //cin>>t;
    for(int i=1;i<=t;i++) solve(i);
}