#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void solve(ll a[], ll n, ll &p, ll &q) {
  for (ll i = 0; i < n; i++) {
    if (a[i] == 0)
      p = i;
    else if (a[i] == 15)
      q = i;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  ll n;
  cin >> n;
  vector<vector<ll>> v;
  for (ll i = 0; i < n; i++) {
    vector<ll> v1;
    for (ll j = 0; j < n; j++) {
      ll k;
      cin >> k;
      v1.push_back(k);
    }
    v.push_back(v1);
  }
  vector<ll> ans;
  bool f = false;
  ll p = n - 1;
  for (ll i = 0; i < n; i++) {
    sort(v[i].begin(), v[i].end());
    ll counter = 1;
    f = false;
    for (ll j = 0; j < n; j += counter) {
      counter = count(v[i].begin(), v[i].end(), v[i][j]);
      if (counter > 1) {
        ans.push_back(v[i][j]);
        f = true;
        break;
      }
    }
    if (!f) {
      ans.push_back(p);
      p++;
    }
  }
  for (ll i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  return 0;
}
