Hi all!

Straightly to the problem — you are given a set of N (1 < N <  = 10⁵) distinct points with integer coordinates on coordinate plane. For each point you need to find number of closest point to it (from set, expect itself). If there are more than one output point with minimum number.

Input
4
0 0
1 1
1 0
0 1

Output
3 3 1 1