#include <bits/stdc++.h>
using namespace std;
int fq[100][100];
int r[100];
bool t[100];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) {
      int a;
      scanf("%d", &a);
      ++fq[i][a];
    }
  for (int j = 1; j < n; ++j)
    for (int i = 0; i < n; ++i) {
      if (!t[i] && fq[i][j] == n - j) {
        t[i] = 1;
        r[i] = j;
        break;
      }
    }
  for (int i = 0; i < n; ++i)
    if (!r[i]) {
      r[i] = n;
      break;
    }
  for (int i = 0; i < n; ++i) printf("%d ", r[i]);
  printf("\n");
  return 0;
}
