#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<string>
#include<iomanip>
#include<cmath>
#include<set>
using namespace std;
using ll = long long;
#define int ll

const int mxn = 1e6 + 2e5 + 5;

vector<int> v;

void solve()
{
    int n;
    cin >> n;
    vector<int> v, vv(mxn);
    for (int i = 0; i <= mxn; i++)
    {
        v.push_back(i);
    }
    for (int i = 1; i <= n; i++)
    {
        int p;
        cin >> p;
        vv[i] = p;
        int pos = upper_bound(v.begin(), v.end(), p) - v.begin() - 1;
        v.erase(v.begin() + pos);
    }
    int q;
    cin >> q;
    while (q--)
    {
        int idx;
        cin >> idx;
        int p = vv[idx];
        int pp = upper_bound(v.begin(), v.end(), p) - v.begin();
        cout << v[pp] << endl;
        v.erase(v.begin() + pp);
        int pos = upper_bound(v.begin(), v.end(), p) - v.begin() - 1;
        v.insert(v.begin() + pos, p);
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}