Nested Ranges Count

Given $nn$ ranges, your task is to count for each range how many other ranges it contains and how many other ranges contain it.

Range $[a,b][a,b]$ contains range $[c,d][c,d]$ if $a\le ca\; \backslash le\; c$ and $d\le bd\; \backslash le\; b$.

Input

The first input line has an integer $nn$: the number of ranges.

After this, there are $nn$ lines that describe the ranges. Each line has two integers $xx$ and $yy$: the range is $[x,y][x,y]$.

You may assume that no range appears more than once in the input.

Output

First print a line that describes for each range (in the input order) how many other ranges it contains.

Then print a line that describes for each range (in the input order) how many other ranges contain it.