Problem: 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, j between 1 and n, he wrote the number ai, j = min(pi, pj). He writes ai, i = 0 for all integer i from 1 to n.

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

Input

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

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

Output

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.

Examples

Input

2
0 1
1 0


Output

2 1


Input

5
0 2 2 1 2
2 0 4 1 3
2 4 0 1 3
1 1 1 0 1
2 3 3 1 0


Output

2 5 4 1 3

Note

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}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50 + 5;
int num[MAXN], ans[MAXN], used[MAXN];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    memset(ans, 0, sizeof(ans));
    for (int i = 0; i < n; ++i) {
      memset(num, 0, sizeof(num));
      for (int j = 0; j < n; ++j) {
        int x;
        scanf("%d", &x);
        ++num[x];
      }
      for (int j = 1; j < n; ++j) {
        if (num[j] == n - j) ans[i] = j;
      }
    }
    if (n == 1) {
      puts("1");
      continue;
    }
    memset(used, 0, sizeof(used));
    for (int i = 0; i < n; ++i) {
      if (!used[ans[i]]) {
        printf("%d ", ans[i]);
        used[ans[i]] = 1;
      } else {
        printf("%d ", n);
      }
    }
    puts("");
  }
  return 0;
}