#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n;
set<pii> s;

int main() {
    scanf("%d", &n);
    vector<vector<int>> c(n - 1);
    vector<vector<int>> v(n, vector<int>());
    vector<set<int>> s(n);
    for (int i = 0; i < n - 1; i++) {
        c[i].resize(i + 1);
        for (auto &e: c[i]) scanf("%d", &e);
        for (int j = i / 2 + 1; j < i + 1; j++) s[i + 1].emplace(c[i][j]);
    }
    vector<int> ans{0};
    for (int i = 1; i < n; i++) {
        bool ck = 0;
        for (int j = 0; j < i; j++) {
            bool ok = 1;
            if (j && s[i].find(ans[j - 1]) != s[i].end()) ok = 0;
            if (j != i - 1 && s[i].find(ans[j + 1]) != s[i].end()) ok = 0;
            if (ok) {
                ans.insert(ans.begin() + j, i);
                ck = 1;
                break;
            }
        }
        if (!ck && s[i].find(ans.back()) == s[i].end()) ans.emplace_back(i);
    }
    for (auto &e: ans) printf("%d ", e);
}