//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int grid[505][505];
int pos[505][505];
set<int> st[505];
bool used[505];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<n;i++)
		for(int j=1;j<=n;j++)
		{
			cin>>grid[i][j];
			pos[i][grid[i][j]]=j;
		}
	for(int i=1;i<=n;i++)
	{
		bool flag=1;
		vector<int> ans;
		for(int j=1;j<n;j++)
			st[j].clear();
		for(int j=1;j<n;j++)
			for(int x=pos[j][i]+1;x<=n;x++)
				st[j].insert(x);
		memset(used,0,sizeof(used));
		for(int j=1;j<n;j++)
		{
			int p=0;
			for(int x=1;x<n;x++) if(!used[x])
				if(!p||sz(st[x])<sz(st[p]))
					p=x;
			if(!sz(st[p]))
			{
				flag=0;
				break;
			}
			used[p]=1;
			int ppos=*st[p].rbegin();
			st[p].erase(ppos);
			int value=grid[p][ppos];
			for(int x=1;x<n;x++)
				if(pos[x][value]>pos[x][i])
					st[x].erase(pos[x][value]);
			ans.pb(p);
		}
		if(!flag)
			cout<<"No\n";
		else
		{
			cout<<"Yes\n";
			for(auto x:ans)
				cout<<x<<" ";
			cout<<'\n';
		}
	}
	return 0;
}