#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < n; i += 1)
#define len(a) ((int)(a).size())


const ll inf = 1e18;
mt19937 rnd(234);


int n;
vector<vector<int>> p, pos;
int cur_racer;
vector<int> matched;
int usdc = -1;
vector<int> usd;
vector<int> bro;


bool dfs(int v) {
    usd[v] = usdc;
    for (int i = pos[v][cur_racer] + 1; i < n; i += 1) {
        int to = p[v][i];
        if (bro[to] == -1) {
            bro[to] = v;
            matched[v] = true;
            return true;
        }
        if (usd[bro[to]] != usdc) {
            if (dfs(bro[to])) {
                bro[to] = v;
                matched[v] = true;
                return true;
            }
        }
    }
    return false;
}


vector<int> build_answer() {
    vector<int> cur_index(n - 1), cur_last(n - 1, n - 1);
    rep(i, n) {
        if (bro[i] != -1) {
            cur_index[bro[i]] = pos[bro[i]][i];
        }
    }
    vector<int> eliminated(n, false);
    eliminated[cur_racer] = true;
    vector<int> usd(n - 1, false);
    vector<int> result;
    while (len(result) < n - 1) {
        while (1) {
            bool changed = false;
            rep(i, n - 1) {
                if (usd[i]) continue;
                while (eliminated[p[i][cur_last[i]]]) {
                    cur_last[i] -= 1;
                    changed = true;
                }
                if (cur_index[i] == cur_last[i]) {
                    result.push_back(i);
                    usd[i] = true;
                    eliminated[p[i][cur_index[i]]] = true;
                    changed = true;
                }
            }
            if (!changed) {
                break;
            }
        }
        int u = -1;
        rep(i, n - 1) {
            if (!usd[i] and cur_index[i] < cur_last[i]) {
                u = i;
            }
        }
        if (u != -1) {
            vector<int> deletion_pos(n, -1);
            rep(i, n - 1) {
                if (!usd[i]) {
                    deletion_pos[p[i][cur_index[i]]] = i;
                }
            }
            rep(i, n) if (!eliminated[i]) assert(deletion_pos[i] != -1);
            rep(i, n) {
                u = deletion_pos[p[u][cur_last[u]]];
            }
            vector<int> cycle;
            int v = u;
            while (1) {
                cycle.push_back(v);
                v = deletion_pos[p[v][cur_last[v]]];
                if (v == u) {
                    break;
                }
            }
            for (auto v : cycle) {
                cur_index[v] = cur_last[v];
            }
        }
    }
    return result;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n;
    p.assign(n - 1, vector<int>(n));
    pos.assign(n - 1, vector<int>(n));
    rep(i, n - 1) {
        rep(j, n) {
            int x; cin >> x; --x;
            p[i][j] = x;
            pos[i][x] = j;
        }
    }
    usd.assign(n - 1, 0);
    usdc = 1;
    vector<int> racers_permutation(n);
    rep(i, n) racers_permutation[i] = i;
    shuffle(all(racers_permutation), rnd);
    bro.assign(n, -1);
    vector<vector<int>> result(n, vector<int>());
    for (auto _cur_racer : racers_permutation) {
        cur_racer = _cur_racer;
        matched.assign(n - 1, false);
        ++usdc;
        for (int v = 0; v < n; v += 1) {
            if (v == cur_racer) {
                bro[v] = -1;
                continue;
            }
            if (bro[v] != -1 and pos[bro[v]][cur_racer] < pos[bro[v]][v]) {
                matched[bro[v]] = true;
                // bro[v] = -1;
            } else {
                bro[v] = -1;
            }
        }
        while (1) {
            ++usdc;
            bool flag = false;
            rep(v, n - 1) {
                if (!matched[v] and usd[v] != usdc) {
                    if (dfs(v)) {
                        flag = true;
                    }
                }
            }
            if (!flag) {
                break;
            }
        }
        int cnt = 0;
        rep(i, n) {
            if (bro[i] != -1) {
                cnt += 1;
            }
        }
        assert(0 <= cnt and cnt <= n - 1);
        if (cnt == n - 1) {
            result[cur_racer] = build_answer();
        }
    }
    rep(cur_racer, n) {
        if (result[cur_racer].empty()) {
            cout << "No" << "\n";
        } else {
            cout << "Yes" << "\n";
            for (auto x : result[cur_racer]) {
                cout << x + 1 << " ";
            }
            cout << "\n";
        }
    }
    return 0;
}