#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64 = long long;
using a2 = array<i64, 2>;

struct SegTree {
#define ls (p << 1)
#define rs ((p << 1) | 1)
#define mid ((l + r) >> 1)

    int n;
    vector<i64> mex, val;

    SegTree(int N = 0) : n(N) {
        mex.resize(n << 2 | 1);
        val.resize(n << 2 | 1);
    }

    a2 query(i64 limit, int p, int l, int r) {
        if (l == r)
            if (val[p] <= limit)
                return { mex[p], val[p] };
            else
                return { limit, limit };

        if (val[ls] <= limit) {
            auto [Mex, Val] = query(limit, ls, l, mid);
            if (Val)
                return { Mex + mex[rs], val[rs] };
            return { Mex, Val };
        } else {
            auto [Mex, Val] = query(val[ls], rs, mid + 1, r);
            return { limit * (mid - l + 1ll) + Mex, Val };
        }
    }

    void update(int p, int l, int r) {
        mex[p] = mex[ls];
        val[p] = val[ls];
        if (val[ls]) {
            auto [Mex, Val] = query(val[ls], rs, mid + 1, r);
            mex[p] += Mex;
            val[p] = Val;
        }
    }

    void add(int x, int k, int p, int l, int r) {
        if (l == r) {
            val[p] += k;
            mex[p] = val[p];
            // cout << p << ' ' << l << ' ' << r << ' ' << mex[p] << ' ' << val[p] << endl;
            return;
        }

        if (x <= mid)
            add(x, k, ls, l, mid);
        if (mid + 1 <= x)
            add(x, k, rs, mid + 1, r);
        update(p, l, r);
        // cout << p << ' ' << l << ' ' << r << ' ' << mex[p] << ' ' << val[p] << endl;
    }
};

void solve() {
    int n;
    cin >> n;

    SegTree tr(n);
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        tr.add(i, x, 1, 1, n);
        // cout << endl;
    }
    cout << tr.mex[1] << endl;

    int q;
    cin >> q;
    while (q--) {
        int op, x;
        cin >> op >> x;
        x++;
        if (x <= n) {
            if (op == 1)
                tr.add(x, 1, 1, 1, n);
            else
                tr.add(x, -1, 1, 1, n);
        }
        // cout << endl;
        cout << tr.mex[1] << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}