#ifdef DS
    #include "debug.h"
#else 
    #include<bits/stdc++.h>
    #define deb(...) 
#endif
using namespace std;
#define FOR(i,a,b) for (int i=a;i<=b;i++)
#define FOD(i,a,b) for (int i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define NALL(x) x.begin()+1,x.end()
#define TIME "Time elapsed : "<<(double)clock()/1000<<" s"
#define int long long
#define vi vector<int>
#define pii pair<int,int>
const int MOD=1e9+7,INF=4e18;
#define maxn 
struct Node{
    int val;
    Node()
    {
        // init val for the empty Node
        val = 0;
    }
};
Node makeNode(int _val)
{
    Node ans;
    // assign the value to Node
    ans.val = _val;
    return ans;
}
Node Merge(Node l,Node r)
{
    Node ans;
    // combine two Node
    ans.val = l.val + r.val;
    return ans;
}
struct Segment_Tree{
    vector<Node> st;
    Segment_Tree (int _sz)
    {
        st.resize(_sz << 2);
    }
    void update(int id,int l,int r,int pos,int val)
    {
        if (l > pos || r < pos) return;
        if (l == r) 
            return st[id] = makeNode(val), void(); // base Node
        int m = l+r >> 1;
        update(id << 1,l,m,pos,val);
        update(id << 1 | 1,m+1,r,pos,val);
        st[id] = Merge(st[id << 1], st[id << 1 | 1]);
    }
    Node get(int id,int l,int r,int u,int v)
    {
        if (r < u || l > v) return Node();
        if (l >= u && r <= v) return st[id];
        int m = l+r >> 1;
        return Merge(get(id << 1,l,m,u,v), get(id << 1 | 1,m+1,r,u,v));
    }
};
int pos[100005];
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("thu.inp","r",stdin);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n; cin>>n;
    vi a(n+1);
    int x_max = 0;
    FOR(i,1,n) 
    {
        cin>>a[i];
        x_max = max(x_max,a[i]);
        pos[i] = a[i];
    }
    int N = 1e6 + 2e5;
    Segment_Tree st(N);
    FOR(i,1,n)
    {
        st.update(1,1,N,a[i],1);
    }
    int q; cin>>q;
    while (q--)
    {
        int x; cin>>x;
        int val = pos[x];
        int l = val+1, r = N;
        int ans = -1;
        while (l <= r)
        {
            int m = l+r >> 1;
            if (st.get(1,1,N,val+1,m).val < m-val)
            {
                ans = m;
                r = m-1;
            }
            else l = m+1;
        }
        cout<<ans<<'\n';
        st.update(1,1,N,val,0);
        pos[x] = ans;
        st.update(1,1,N,ans,1);
    }
}