#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define uint unsigned long long
#define lb(x) (x & (-x))
#define endl '\n'
#define INF LONG_LONG_MAX
#define eps 1e-7
const int N = 2e5 + 5;
typedef pair<int, int> PII;
int ar[3 * N];
int n, idx = 0, q;
int find(int x)
{
    int l = 0, r = idx + 1;
    while (l + 1 < r)
    {
        int mid = (l + r) >> 1;
        if (ar[mid] <= x)
            l = mid;
        else
            r = mid;
    }
    return r;
}
void solve()
{
    idx = 0;
    cin >> n;
    map<int, int> mp;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        mp[i] = x;
        if (i != 1)
        {
            int x = mp[i - 1] + 1;
            if (x >= mp[i])
                continue;
            for (int j = x; j < mp[i]; j++)
            {
                ar[++idx] = j;
            }
        }
    }
    for (int i = mp[n] + 1; i <= mp[n] + n + n; i++)
    {
        ar[++idx] = i;
    }

    cin >> q;
    while (q--)
    {
        int x;
        cin >> x;
        int st = find(mp[x]);
        int t = ar[st];
        ar[st] = mp[x];
        mp[x] = t;
        cout << t << endl;
    }
}
signed main()
{
    IOS;
    solve();
    return 0;
}