#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 500;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;

    std::vector a(n - 1, std::vector<int>(n));
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n; j++) {
            std::cin >> a[i][j];
            a[i][j]--;
        }
    }

    for (int s = 0; s < n; s++) {
        std::vector<std::bitset<N>> adj(n - 1);
        for (int i = 0; i < n - 1; i++) {
            int k = std::find(a[i].begin(), a[i].end(), s) - a[i].begin();
            for (int j = k + 1; j < n; j++) {
                adj[i][a[i][j]] = 1;
            }
        }

        std::vector<int> yx(n, -1), xy(n - 1, -1);
        int ans = 0;

        while (true) {
            std::bitset<N> visy{};
            
            std::vector<int> hx(n - 1, -1);
            std::vector<std::bitset<N>> hy(n);
            std::queue<int> q;
            for (int i = 0; i < n - 1; i++) {
                if (xy[i] == -1) {
                    q.push(i);
                    hx[i] = 0;
                }
            }

            int mhy = -1;
            while (!q.empty()) {
                int x = q.front();
                q.pop();

                while (true) {
                    auto v = adj[x] & ~visy;
                    if (v.none()) {
                        break;
                    }
                    int y = v._Find_first();
                    visy[y] = 1;
                    hy[hx[x]][y] = 1;
                    if (yx[y] != -1) {
                        hx[yx[y]] = hx[x] + 1;
                        q.push(yx[y]);
                    } else if (mhy == -1) {
                        mhy = hx[x];
                    }
                }
            }
            // std::cerr << ans << " " << mhy << "\n";
            
            if (mhy == -1) {
                break;
            }
            std::vector<bool> visx(n - 1);

            auto find = [&](auto self, int x) -> bool {
                if (hx[x] > mhy) {
                    return false;
                }
                visx[x] = true;
                while (true) {
                    auto v = hy[hx[x]] & adj[x];
                    if (v.none()) {
                        return false;
                    }
                    int y = v._Find_first();
                    hy[hx[x]][y] = 0;
                    if (yx[y] == -1 || (!visx[yx[y]] && self(self, yx[y]))) {
                        xy[x] = y;
                        yx[y] = x;
                        // std::cerr << "(" << x << ", " << y << ") ";
                        return true;
                    }
                }
            };

            for (int i = 0; i < n - 1; i++) {
                if (!visx[i] && hx[i] == 0) {
                    ans += find(find, i);
                }
            }
        }

        // for (int i = 0; i < n - 1; i++) {
        //     std::cerr << xy[i] << " \n"[i == n - 2];
        // }
        // std::cerr << "--\n";
        if (ans == n - 1) {
            std::cout << "Yes\n";
            std::vector<int> cur(n - 1, n - 1);
            std::vector<bool> del(n);
            for (int t = 0; t < n - 1; t++) {
                int u = -1;
                for (int i = 0; i < n - 1; i++) {
                    if (cur[i] == -1) {
                        continue;
                    }
                    while (del[a[i][cur[i]]]) {
                        cur[i] -= 1;
                    }
                    if (xy[i] == a[i][cur[i]]) {
                        u = i;
                    }
                }
                if (u == -1) {
                    int x = -1;
                    std::vector<int> p(n, -1);
                    for (int i = 0; i < n - 1; i++) {
                        if (cur[i] == -1) {
                            continue;
                        }
                        x = xy[i];
                        p[xy[i]] = a[i][cur[i]];
                    }
                    for (int i = 0; i < n; i++) {
                        x = p[x];
                    }
                    std::vector<bool> cyc(n);
                    for (int i = 0; i < n; i++) {
                        cyc[x] = true;
                        x = p[x];
                    }
                    for (int i = 0; i < n - 1; i++) {
                        if (cur[i] == -1) {
                            continue;
                        }
                        if (cyc[xy[i]]) {
                            xy[i] = a[i][cur[i]];
                            u = i;
                        }
                    }
                }
                assert(u != -1);
                cur[u] = -1;
                del[xy[u]] = true;
                std::cout << u + 1 << " \n"[t == n - 2];
            }
        } else {
            std::cout << "No\n";
        }
    }

    return 0;
}