Favorite Colors#10311
Each of Farmer John's cows has a favorite color. The cows are conveniently labeled .. (as always), and each color can be represented by an integer in the range ...
There exist pairs of cows (, ) such that cow admires cow (1 \le m \le 2 \cdot 10^5). It is possible that a = b, in which case a cow admires herself. For any color , if cows and both admire a cow with favorite color , then and share the same favorite color.
Given this information, determine an assignment of cows to favorite colors such that the number of distinct favorite colors among all cows is maximized. As there are multiple assignments that satisfy this property, output the lexicographically smallest one (meaning that you should take the assignment that minimizes the colors assigned to cows .. in that order).
The first line contains (1 \le n \le 2 \cdot 10^5) and . The next lines each contain two space-separated integers and (1 \le a, b \le n), denoting that cow admires cow . The same pair may appear more than once in the input.
For each in .., output the color of cow in the desired assignment on a new line.
Example 1
In the image below, the circles with bolded borders represent the cows with favorite color .
