Defile

Defile, a Hearthstone spell card that Junwon likes, has the following effect: "Deal 1 damage to all minions. If any die, cast this again."

In other words: represent the health of the minions currently on the board as a sequence of $r$ positive integers $a_1, \dots, a_r$. Playing Defile performs the following operation on the sequence $a$.

1. Decrease $a_1, \dots, a_r$ all by 1.
2. If any element $a_i$ equals 0, remove all such $a_i$ from the sequence and return to step 1. Increase the "number of dead minions" count by the number of removed elements. If no such $a_i$ exists, stop the process.

Currently there are no minions on the board. Hearthstone has many variables, but assume only the following two changes occur.

1. A minion with health $k$ is added to the board.
2. A minion with health $k$ is removed from the board.

After each change occurs, you must find the number of minions that die when Defile is played once.

All changes accumulate. Also note that you do not actually play Defile; you only suppose the situation in which the card is played.

The first line gives $Q$, the number of changes that occur on the board. ($1 \le Q \le 1{,}000{,}000$)

The next $Q$ lines each give two integers $T, K$ describing a change on the board. ($T = 1$ or $T = 2$, $1 \le K \le 1{,}000{,}000$)

When $T = 1$, a minion with health $K$ is added to the board.

When $T = 2$, a minion with health $K$ is removed from the board. It is guaranteed that at least one minion with health $K$ is on the board at this time.

After each change given in the input occurs, find the number of minions that would die if Defile were played, and print one per line.

Because the input and output are very large, using fast input and output is recommended.