Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Nikita and stack

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputNikita has a stack. A stack in this problem is a data structure that supports two operations. Operation push(x) puts an integer *x* on the top of the stack, and operation pop() deletes the top integer from the stack, i. e. the last added. If the stack is empty, then the operation pop() does nothing.

Nikita made *m* operations with the stack but forgot them. Now Nikita wants to remember them. He remembers them one by one, on the *i*-th step he remembers an operation he made *p*_{i}-th. In other words, he remembers the operations in order of some permutation *p*_{1}, *p*_{2}, ..., *p*_{m}. After each step Nikita wants to know what is the integer on the top of the stack after performing the operations he have already remembered, in the corresponding order. Help him!

Input

The first line contains the integer *m* (1 ≤ *m* ≤ 10^{5}) — the number of operations Nikita made.

The next *m* lines contain the operations Nikita remembers. The *i*-th line starts with two integers *p*_{i} and *t*_{i} (1 ≤ *p*_{i} ≤ *m*, *t*_{i} = 0 or *t*_{i} = 1) — the index of operation he remembers on the step *i*, and the type of the operation. *t*_{i} equals 0, if the operation is pop(), and 1, is the operation is push(x). If the operation is push(x), the line also contains the integer *x*_{i} (1 ≤ *x*_{i} ≤ 10^{6}) — the integer added to the stack.

It is guaranteed that each integer from 1 to *m* is present exactly once among integers *p*_{i}.

Output

Print *m* integers. The integer *i* should equal the number on the top of the stack after performing all the operations Nikita remembered on the steps from 1 to *i*. If the stack is empty after performing all these operations, print -1.

Examples

Input

2

2 1 2

1 0

Output

2

2

Input

3

1 1 2

2 1 3

3 0

Output

2

3

2

Input

5

5 0

4 0

3 1 1

2 1 1

1 1 2

Output

-1

-1

-1

-1

2

Note

In the first example, after Nikita remembers the operation on the first step, the operation push(2) is the only operation, so the answer is 2. After he remembers the operation pop() which was done before push(2), answer stays the same.

In the second example, the operations are push(2), push(3) and pop(). Nikita remembers them in the order they were performed.

In the third example Nikita remembers the operations in the reversed order.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/12/2018 20:59:31 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|