#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
if (N == 1) {
cout << "1\n";
return 0;
}
vector<vector<int>> M(N, vector<int> (N, 0));
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
cin >> M[i][j];
}
}
int x = M[0][N - 1];
int l = 0;
while (M[l + 1][N - 1] == x) l++;
int r = N - 1;
while (M[0][r - 1] == x) r--;
cout << l + 1 << ' ';
for (int i = l + 1; i < r; i++) {
if (M[l + 1][i - 1] < M[l][i - 1]) {
if (M[l][i] == M[l][i - 1] + 1) {
cout << i + 1 << ' ';
}
}
else if (M[i + 1][r - 1] < M[i + 1][r]) {
if (M[i][r] == M[i + 1][r] + 1) {
cout << i + 1 << ' ';
}
}
else {
if (M[l + 1][i] == M[l + 1][i - 1] && M[i][r - 1] == M[i + 1][r - 1]) {
cout << i + 1 << ' ';
}
}
}
cout << r + 1 << '\n';
return 0;
}
