You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.

The first line contains a single integer n (1≤n≤2·10⁵) − the number of segments on a line.

Each of the next n lines contains two integers l_i and r_i (-10⁹≤l_i<r_i≤10⁹) − the coordinates of the left and the right ends of the i-th segment. It is guaranteed that there are no ends of some segments that coincide.

Print n lines. The j-th of them should contain the only integer a_j − the number of segments contained in the j-th segment.