#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define int long long
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 5e5+10;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 2e18;
const int MOD = 1e9+7;
const int LOG = 32;
ll sum(auto a, auto b){
ll te = a+MOD+b;
for(; te >= MOD; ) te -= MOD;
return te;
}
void chsum(auto &a, auto b){ a = sum(a,b); }
ll mul(auto a, auto b){ return 1ll*a*b%MOD; }
void chmul(auto &a, auto b){ a = mul(a,b); }
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
ll expo(int a, int b){
if(b==0) return 1;
ll te = expo(a, b/2); te = mul(te,te); // temporary -> te
return (b%2 ? mul(te, a) : te);
}
vector <int> dx = {0, 0, -1, 1};
vector<int> dy = {-1, 1, 0, 0};
int n, a[1010][1010];
int day, b[1010];
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1; i<n; i++){
for(int j=0; j<i; j++) cin>>a[i][j];
}
vector<int> vec; vec.pb(1); vec.pb(0);
for(int i=2; i<n; i++){
vector<int> vec2;
day++;
for(int j=0; j<=(i-1)/2; j++){
b[a[i][j]] = day;
// cout << i << ' '<< a[i][j] << " pp\n";
}
for(int j=0; j<vec.size(); j++){
if(b[vec[j]] == day){
if(j != 0){
if(b[vec[j-1]] == day){
for(int k=0; k<=j-1; k++) vec2.pb(vec[k]);
vec2.pb(i);
for(int k=j; k<vec.size(); k++) vec2.pb(vec[k]);
break;
}
} else {
vec2.pb(i);
for(int k=j; k<vec.size(); k++) vec2.pb(vec[k]);
break;
}
}
}
if(vec2.size() != i+1){
vec2 = vec;
vec2.pb(i);
}
swap(vec, vec2);
// for(auto in : vec) cout << in << ' ';
// cout << "xx\n";
}
for(auto in : vec) cout << in << ' ';
cout << '\n';
}
