CF652D Nested Segments

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

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.