#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
void solve() {
int n;
cin >> n;
int grid[n+1][n+1];
for(int i=1; i<=n; ++i) for(int j=i; j<=n; ++j) cin >> grid[i][j];
int cnt = grid[1][n], l = 1, r = n;
while(l+1<=n && grid[l+1][n] == cnt) ++l;
while(r-1>=l && grid[l][r-1] == cnt) --r;
vi ind;
ind.push_back(l);
for(int i=l+1; i<r; ++i) {
if(grid[l][i-1] != grid[l+1][i-1]) {
if(grid[l][i] == grid[l][i-1]+1) ind.push_back(i);
continue;
}
if(grid[i+1][r] != grid[i+1][r-1]) {
if(grid[i][r] == grid[i+1][r]+1) ind.push_back(i);
continue;
}
if(grid[l+1][i-1] == grid[l+1][i] && grid[i][r-1] == grid[i+1][r-1]) ind.push_back(i);
}
if(l!=r) ind.push_back(r);
for(int x: ind) cout << x << " ";
cout << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tc = 1;
while(tc--) solve();
return 0;
}
