#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n, a[55][55], ans[55];
int main() {
  ios_base::sync_with_stdio(0);
  while (scanf("%d", &n) == 1) {
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j) scanf("%d", &a[i][j]);
    for (int i = 1; i <= n; ++i) {
      set<int> s;
      for (int j = 1; j <= n; ++j) s.insert(a[i][j]);
      if (s.size() != n) continue;
      for (int j = 1; j <= n; ++j) ans[j] = a[i][j] ? a[i][j] : n;
      bool ok = true;
      for (int j = 1; j <= n; ++j) {
        for (int k = 1; k <= n; ++k) {
          if (j == k) continue;
          if (min(ans[j], ans[k]) != a[j][k]) {
            ok = false;
            break;
          }
        }
        if (!ok) break;
      }
      if (ok) break;
    }
    for (int i = 1; i <= n; ++i) printf("%d%c", ans[i], " \n"[i == n]);
  }
  return 0;
}
