Problem 1A. Archery Tournament ≡

Statement

You were invited to the annual archery tournament. You are going to compete against the best archers from all of the Northern Eurasia. This year, a new type of competition is introduced, where a shooting range is dynamic and new targets might appear at any second.

As the shooting range is far enough from you, it can be represented as a 2D plane, where y = 0 is the ground level. There are some targets in a shape of a circle, and all the targets are standing on the ground. That means, if a target's center is (x, y) (y > 0), then its radius is equal to y, so that it touches the line y = 0. No two targets simultaneously present at the range at any given time intersect (but they may touch).

Initially, the shooting range is empty. Your participation in this competition can be described as n events: either a new target appears at the range, or you shoot an arrow at some point at the range. To hit a target, you must shoot strictly inside the circle (hitting the border does not count). If you shoot and hit some target, then the target is removed from the range and you are awarded one point.

Input format

The first line of the input contains integer n (1 ≤ n ≤ 2 ⋅ 10⁵). Next n lines describe the events happening at the tournament. The i-th line contains three integers t_i, x_i, and y_i (t_i = 1, 2;  − 10⁹ ≤ x_i, y_i ≤ 10⁹; y_i > 0).

• If t_i = 1, then a new target with center (x_i, y_i) and radius y_i appears at the range.
• If t_i = 2, then you perform a shot, which hits the range at (x_i, y_i).

Output format

For each of your shots, output a separate line with the single integer. If the shot did not hit any target, print ``-1″. If the shot hit a target, print the number of event when that target was added to the range. Events are numbered starting from 1.

Sample tests

8
1 0 12
2 -11 22
1 24 10
1 12 3
2 12 12
2 16 14
1 28 15
2 3 6

-1
-1
3
1