Way Home

On his way home from work, Gennady Evgenyevich Chudakov noticed several road signs placed along the road. Each sign is a plate with a number written on it. At any moment, the active sign is the most recent sign that has not been canceled among all signs seen so far. For a sign with number $x$:

• $x > 0$: The sign with number $x$ becomes active.
• $x < 0$: If a sign with number $-x$ appeared earlier on the road, its effect is canceled.
• $x = 0$: The currently active sign is canceled. If there is no active sign, nothing happens.

A number $x \neq 0$ appears on the road at most once. For example, if Chudakov passes the four signs $1, 2, -2, 0$ in this order, the active sign after $-2$ is $1$.

Chudakov wants to know the active sign after each new sign he passes, but he has no time to solve this because he is busy with other things. Help him.

The first line contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$), the number of signs on the road.

Each of the next $n$ lines contains one integer $a_i$ ($-10^5 \le a_i \le 10^5$), the number written on the $i$-th sign that Chudakov passes.

For each sign, print on a new line the number on the active sign after applying that sign's instruction. If there is no active sign, print $0$.