#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ertunt return
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<vector<ll>>a(n);
for(ll i = 0; i < n; i++){
for(ll j = 0; j < n-i; j++){
ll x;
cin >> x;
a[i].pb(x);
}
}
ll l = 0, r = n-1;
for(; l < n; l++){
if(a[l][n-l-1] != a[l+1][n-l])break;
}
while(r-1 >= 0 && a[l][r-1-l] == a[l][r-l]) r--;
for(ll i = l; i <= r; i++){
if(a[l+1][i - l - 2] != a[l][i-1-l]){
if(a[l][i-l] != a[l][i-1-l]){
cout << i+1 << ' ';
}
continue;
}
if(a[i+1][r-i-2] != a[i+1][r-i-1]){
if(a[i][r-i] != a[i+1][r-i-1]){
cout << i+1 << ' ';
}
continue;
}
if(a[l+1][i - l - 2] == a[l+1][i-l-1] and a[i+1][r-i-2] == a[i][r-1-i])
cout << i+1 << ' ';
}
}
