#include <bits/stdc++.h>
using namespace std;
int N, a[60][60], ans[60], mxa[60], top;
bool vis[60];
pair<int, int> minans[60];
void Debug() {}
void Read() {
  cin >> N;
  for (int i = 1; i <= N; ++i)
    for (int j = 1; j <= N; ++j) cin >> a[i][j];
}
void Solve() {
  for (int i = 1; i <= N; ++i) {
    mxa[i] = a[i][1];
    for (int j = 2; j <= N; ++j) mxa[i] = max(mxa[i], a[i][j]);
  }
  for (int i = 1; i <= N; ++i) {
    if (!vis[mxa[i]]) {
      ans[i] = mxa[i];
      vis[mxa[i]] = true;
    } else
      minans[++top] = make_pair(mxa[i] + 1, i);
  }
  sort(minans + 1, minans + top + 1);
  for (int i = 1; i <= top; ++i) {
    for (int j = minans[i].first; j <= N; ++j) {
      if (!vis[j]) {
        ans[minans[i].second] = j;
        vis[j] = true;
        break;
      }
    }
  }
  for (int i = 1; i <= N; ++i) cout << ans[i] << " ";
  cout << "\n";
}
int main() {
  Read();
  Solve();
  Debug();
  return 0;
}
