Author:  A. Baranov  Time limit:  1 sec  
Input file:  Standard input  Memory limit:  256 Mb  
Output file:  Standard output 
Vasya writes a 2D game engine. One of the tasks is to determine parts of the scene visible by the gamer from a given position.
Let us consider a set of rectangles with sides parallel to the coordinate axes: P_{i} = {(x, y): a_{i} ≤ x ≤ b_{i}, c_{i} ≤ y ≤ d_{i}}.
Rectangle P_{i} is visible from the point A, if there exists some point B ∈ P_{i} such that segment AB does not contain points belonging to other rectangles.
Your program must determine indices of rectangles that are visible from the point (0, 0).
Input contains integer n followed by 4 × n integers: a_{i}, b_{i}, c_{i} and d_{i}.
Output must contain indices of visible rectangles in ascending order. Indices start from 0.
Rectangles do not intersect each other and do not contain point (0, 0).
2 ≤ n ≤ 10^{5}
− 10^{6} ≤ a_{i} ≤ b_{i} ≤ 10^{6}
− 10^{6} ≤ c_{i} ≤ d_{i} ≤ 10^{6}
No.  Standard input  Standard output 

1 


2 

