#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n; cin >> n;
vector<vector<int>> mx(n,vector<int>(n,0));
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
{
cin >> mx[i][j];
}
}
int l=0;
int bn=mx[0].back();
if(n>1) {
while(mx[l][n-1]==bn) l++;
l--;
}
int r=n-1;
if(n>1){
while(mx[0][r]==bn) r--;
r++;
}
vector<int> v(n);
for (int i = l+1; i<r; i++)
{
if(mx[l][i]<2) continue;
if(mx[i][r]<2) continue;
if(mx[l][i]>mx[l+1][i-1]){
if(mx[l+1][i]==mx[l][i-1]&&(mx[l+1][i]==mx[l+1][i-1]||mx[l][i]==2+mx[l+1][i-1])) v[i]=2;
continue;
}
if(mx[i][r]>mx[i+1][r-1]){
if(mx[i+1][r]==mx[i][r-1]&&(mx[i+1][r]==mx[i+1][r-1]||mx[i][r]==2+mx[i+1][r-1])) v[i]=2;
continue;
}
v[i]=1;
}
vector<int> a;
a.push_back(l+1);
if(l!=r) a.push_back(r+1);
for (int i = l+1; i<r; i++)
{
if(v[i]==2) a.push_back(i+1);
}
for (int i = l+1; i<r; i++)
{
if(sz(a)==bn) break;
if(v[i]==1) a.push_back(i+1);
}
sort(all(a));
for (int i = 0; i < sz(a); i++)
{
cout << a[i] << " ";
}
return 0;
}
