import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    Q = int(data[idx])
    idx += 1
    
    added_order = []  # Stores the base values of all added researchers in order
    sorted_bases = []  # Maintained sorted list of active base values
    offset = 0  # Current offset added to all researchers
    
    results = []
    
    for _ in range(Q):
        t = int(data[idx])
        x = int(data[idx + 1])
        idx += 2
        
        if t == 1:
            base = x - offset
            added_order.append(base)
            bisect.insort(sorted_bases, base)
        elif t == 2:
            pos = x - 1
            base = added_order[pos]
            index = bisect.bisect_left(sorted_bases, base)
            if index < len(sorted_bases) and sorted_bases[index] == base:
                del sorted_bases[index]
        elif t == 3:
            offset += x
        
        M = len(sorted_bases)
        if M == 0:
            results.append(0)
            continue
        
        low, high = 0, M
        best = 0
        while low <= high:
            mid = (low + high) // 2
            if mid == 0:
                best = 0
                low = mid + 1
                continue
            required = mid - offset
            cnt = M - bisect.bisect_left(sorted_bases, required)
            if cnt >= mid:
                best = mid
                low = mid + 1
            else:
                high = mid - 1
        
        results.append(str(best))
    
    print('\n'.join(results))

if __name__ == "__main__":
    main()