#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


Q = int(readline())
m = map(int, read().split())
query = tuple(zip(m, m))

nums = []
base = 0
for t, x in query:
    if t == 1:
        nums.append(x - base)
    elif t == 2:
        continue
    else:
        base += x

INF = 10 ** 18
nums.append(-INF)
nums.append(INF)
nums = sorted(set(nums))
num_rank = {x: i for i, x in enumerate(nums)}


def solve(bit, nums, full, base):
    left = 0
    right = full + 1
    while left + 1 < right:
        k = (left + right) // 2
        if base + nums[bit.find_kth_element(full + 1 - k)] >= k:
            left = k
        else:
            right = k
    return left


bit = BinaryIndexedTree([0] * (len(nums)))
base = 0
member = []
full = 0
for t, x in query:
    if t == 1:
        r = num_rank[x - base]
        member.append(r)
        bit.add(r, 1)
        full += 1
    elif t == 2:
        r = member[x - 1]
        bit.add(r, -1)
        full -= 1
    else:
        base += x
    print(solve(bit, nums, full, base))