#include <bits/stdc++.h>
using namespace std;
bool isPrime[1000005] = {false};
vector<long long int> SPF(1000005);
long long int fastPower(long long int a, long long int b) {
  if (b == 0) return 1;
  long long int prod = 1;
  while (b > 0) {
    if (b & 1) prod = prod * a;
    b = b >> 1;
    a = a * a;
  }
  return prod;
}
void sieve() {
  int i;
  for (i = 2; i < 1000005; ++i) isPrime[i] = 1;
  for (i = 2; i * i < 1000005; ++i) {
    if (isPrime[i]) {
      for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0;
    }
  }
}
void printa(bool f) {
  if (f)
    cout << "YES";
  else
    cout << "NO";
  cout << "\n";
}
bool flip(bool f) {
  if (f) return 0;
  return 1;
}
int safe(vector<int> a) {
  int n = a.size(), i;
  for (i = 0; i < n; ++i) {
    if (a[i] == 0) return i;
  }
  return -1;
}
void solve() {
  int i, n;
  cin >> n;
  int m[n][n], j;
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) cin >> m[i][j];
  }
  vector<int> ans;
  for (i = 0; i < n; ++i) {
    int mx = INT_MIN;
    for (j = 0; j < n; ++j) {
      mx = max(mx, m[j][i]);
    }
    ans.push_back(mx);
  }
  int t = n;
  n = ans.size();
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      if (i != j && ans[i] == ans[j]) ans[j] = t;
    }
  }
  for (auto x : ans) cout << x << ' ';
  cout << "\n";
}
int main() {
  int tc = 1;
  while (tc--) {
    solve();
  }
  return 0;
}
