#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for(ll i=0; i<n; i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define print(a) cout<<a<<endl
typedef long long ll;
#define yn(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YN(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define so(a) sort(a.begin(),a.end())
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
#define pb push_back
#define a2i(a,s) (ll)(a-s)
#define i2a(s,a) (char)(s+a)
#define ssize(a) a.size()
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<pair<ll,ll>,ll> P3;
typedef pair<pair<ll,ll>,pair<ll,ll>> P4;
typedef pair<ll, ll> Pll;
typedef pair<ll,Pll> Plll;
typedef pair<Pii, int> Piii;
const ll INF = 1000000000000000000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ull=unsigned long long;
vector<ll> g[1009];
ll n;
vector<ll> k(1009,0);
bool b=false;
void saiki(ll pos,ll p){
if(p==n){
b=true;
return;
}
k[pos]=1;
for(ll i=0;i<g[pos].size();i++){
ll nx=g[pos][i];
if(k[nx]==1)continue;
saiki(nx,p+1);
if(b==true){
cout<<nx<<" ";
return;
}
}
k[pos]=0;
return;
}
int main(){
//入力
cin.tie(0);
ios::sync_with_stdio(0);
cin>>n;
vector<vector<ll> > a(n,vector<ll>(n));
for(ll i=1;i<n;i++){
for(ll j=i-1;j>=0;j--){
cin>>a[i][j];
if(j<=(i-1)/2){
g[i].push_back(a[i][j]);
g[a[i][j]].push_back(i);
}
}
}
for(ll i=0;i<n;i++){
saiki(i,1);
if(b==true){
cout<<i<<endl;
break;
}
}
return 0;
}
