In the math class, the teacher made a difficult question:

There are given N points having positive coordinates.

It is guaranteed all the points have distinct x coordinates and there are no two points that are collinear with the origin.

For each point having coordinates (x,y) consider the right triangle formed by:

the point itself: (x,y) 
the origin of the coordinate system: (0,0) 
the point's projection on the x-axis: (x,0).

Ask how many of the other N−1 points the triangle which is formed by the first point contains.
 

Sakamoto is fussy so he thinks this problem is too simple, so he wants to solve a new problem.

For each triangle count how many of the other N-1 points it contains.



Constraints

2<=N<=1e5
The coordinates of the points are between 1 and 1e5.
there are no more than 5 data sets.

Problem contains multiple sets of inputs.
For each group of inputs: The first line contains a single integer N, and each of the next N lines contains two integers representing the coordinates of a point.

For each group of outputs: Print N lines, each containing the answer for a point, in the order given in the input.

2
4 4
1 6
3
2 1
3 2
4 3

0
0
0
1
2