//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];
int 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++)
	{
		vector<int> vec;
		for(int j=1;j<n;j++)
			vec.pb(j);
		sort(ALL(vec),[&](int a,int b)
		{
			return pos[a][i]>pos[b][i];
		});
		memset(used,0,sizeof(used));
		for(auto x:vec)
		{
			int p=n;
			while(p&&used[grid[x][p]])
				p--;
			used[grid[x][p]]=1;
		}
		if(!used[i])
		{
			cout<<"Yes\n";
			for(auto x:vec)
				cout<<x<<" ";
			cout<<'\n';
		}
		else
			cout<<"No\n";
	}
	return 0;
}