#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
ll mod = 998244353;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b)
{
ll res = 1;
while (b>0)
{
if (b&1)
res = (res*a)%mod;
a = (a*a)%mod;
b>>=1;
}
return res;
}
ll gcd(ll x, ll y)
{
if (y==0)
return x;
return gcd(y, x%y);
}
void solve()
{
ll n;
cin>>n;
vector<vector<ll>>v(n+1, vector<ll>(n+1));
for (int i=1 ; i<=n ;i++)
{
v[i][i-1] = 0;
for (int j=i ; j<=n ; j++)
cin>>v[i][j];
}
ll l = n, r = 1;
for (int i=n ; i>=2 ; i--)
{
if (v[1][i]>v[1][i-1])
{
r = i;
break;
}
}
for (int i=1 ; i<=n-1 ;i++)
{
if (v[i][n]>v[i+1][n])
{
l = i;
break;
}
}
set<ll>s;
s.insert(l);
s.insert(r);
for (int i=l+1 ; i<=r-1 ; i++)
{
if (v[l][i-1]>v[l+1][i-1])
{
if (v[l][i-1]<v[l][i])
s.insert(i);
else continue;
}
if (v[i+1][r-1]<v[i+1][r])
{
if (v[i][r]>v[i+1][r])
s.insert(i);
else continue;
}
if (v[l+1][i-1]<v[l+1][i] or v[i][r-1]>v[i+1][r-1])
continue;
s.insert(i);
}
for (auto i:s)
cout<<i<<" ";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll tt = 1;
// cin>>tt;
while (tt--)
{
solve();
}
return 0;
}
