CF618B.Guess the Permutation

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 p__i. For all pairs of distinct integers i, j between 1 and n, he wrote the number a__i, j = min(p__i, p__j). He writes a__i, i = 0 for all integer i from 1 to n.

Bob gave you all the values of a__i, j 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.

鲍勃有一个从 $1$ 到 $n$ 的整数排列，记作 $p$。$p$ 的第 $i$ 个元素记为 $p_i$。对于所有满足 $1 \le i, j \le n$ 且 $i \ne j$ 的不同整数对 $(i, j)$，他写下数值 $a_{i,j} = \min(p_i,\, p_j)$。而对于所有 $i = 1, 2, \dots, n$，他令 $a_{i,i} = 0$。

鲍勃将他写下的所有 $a_{i,j}$ 的值提供给你。你的任务是重构出任意一个能生成这些 $a_{i,j}$ 值的排列 $p$。输入数据保证至少存在一个与所给信息一致的解。

The first line of the input will contain a single integer n (2 ≤ n ≤ 50).

The next n lines will contain the values of a__i, j. The j-th number on the i-th line will represent a__i, j. The i-th number on the i-th line will be 0. It's guaranteed that a__i, j = a__j, i and there is at least one solution consistent with the information given.

输入的第一行包含一个整数 $n$（$2 \leq n \leq 50$）。

接下来的 $n$ 行将包含 $a_{i,j}$ 的值。第 $i$ 行的第 $j$ 个数表示 $a_{i,j}$。第 $i$ 行的第 $i$ 个数为 $0$。保证 $a_{i,j} = a_{j,i}$，且至少存在一个与所给信息一致的解。

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.

输出 n 个空格分隔的整数，表示一个可能生成这些值的排列。如果存在多个可能的解，输出任意一个即可。

In the first case, the answer can be {1, 2} or {2, 1}.

In the second case, another possible answer is {2, 4, 5, 1, 3}.

在第一种情况下，答案可以是 $\{1,\,2\}$ 或 $\{2,\,1\}$。

在第二种情况下，另一个可能的答案是 $\{2,\,4,\,5,\,1,\,3\}$。