Nikita 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₁, p₂, ..., 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!

The first line contains the integer m (1 ≤ m ≤ 10⁵) — 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⁶) — the integer added to the stack.

It is guaranteed that each integer from 1 to m is present exactly once among integers p_i.

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.