//EGOI 2023 Carnival General
//https://qoj.ac/contest/1355/problem/7158
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
int main(){
ll n, a; vll ans; ans.push_back(0);
cin >> n;
for(int i=1; i<n; i++){
vector<bool> can(i,false);
for(int j=0; j<i; j++) cin >> a, can[a]=(j<(i+1)/2);
for(int j=0; j<=i; j++){
bool flag=((j==0 && can[ans[j]]) || (j==i && can[ans[j-1]]) || (can[ans[j]] && can[ans[j-1]]));
if(flag){ans.insert(ans.begin()+j,i); break;}
}
}
for(auto x:ans) cout << x << " ";
cout << "\n";
}
