#include <bits/stdc++.h>
using namespace std;

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

    int Q;
    cin >> Q;
    vector<int> arr;
    multiset<int> s;
    int offset = 0;

    for (int i = 0; i < Q; ++i) {
        int t, x;
        cin >> t >> x;
        if (t == 1) {
            int val = x - offset;
            arr.push_back(val);
            s.insert(val);
        } else if (t == 2) {
            int val = arr[x - 1];
            auto it = s.find(val);
            if (it != s.end()) {
                s.erase(it);
            }
        } else if (t == 3) {
            offset += x;
        }

        int n = s.size();
        int L = 0;
        int low = 0, high = n;
        while (low <= high) {
            int mid = (low + high) / 2;
            if (mid == 0) {
                L = 0;
                low = mid + 1;
                continue;
            }
            int required = mid - offset;
            auto it = s.lower_bound(required);
            int count = distance(it, s.end());
            if (count >= mid) {
                L = mid;
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        cout << L << '\n';
    }

    return 0;
}