B"Bob has a permutation of integers from 1 to n. Denote this permutation as p. The i-th element of p will be denoted as pi. For all pairs of distinct integers i, xe2 x80 x89j between 1 and n, he wrote the number ai, xe2 x80 x89j xe2 x80 x89= xe2 x80 x89min(pi, xe2 x80 x89pj). He writes ai, xe2 x80 x89i xe2 x80 x89= xe2 x80 x890 for all integer i from 1 to n. Bob gave you all the values of ai, xe2 x80 x89j that he wrote down. Your job is to reconstruct any permutation that could have generated these values. The input will be formed so that it is guaranteed that there is at least one solution that is consistent with the information given. The first line of the input will contain a single integer n (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950). The next n lines will contain the values of ai, xe2 x80 x89j. The j-th number on the i-th line will represent ai, xe2 x80 x89j. The i-th number on the i-th line will be 0. It's guaranteed that ai, xe2 x80 x89j xe2 x80 x89= xe2 x80 x89aj, xe2 x80 x89i and there is at least one solution consistent with the information given. Print n space separated integers, which represents a permutation that could have generated these values. If there are multiple possible solutions, print any of them. In the first case, the answer can be {1, xe2 x80 x892} or {2, xe2 x80 x891}. In the second case, another possible answer is {2, xe2 x80 x894, xe2 x80 x895, xe2 x80 x891, xe2 x80 x893}."...