#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#define N 500
#define M 1000
#define K 2000000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,s,t,leng,tong[N+1],depth[M+1],ps[N+1],cl[N+1],in[N+1],p[N+1],sp[N+1],a[N+1][N+1],rk[N+1][N+1];
bool used[M+1],vis[M+1];
bitset<N+1>B[N+1];
bitset<N+1>B2[N+1];
bitset<N+1>S1;
bitset<N+1>S2;
bitset<N+1>useds;
bitset<N+1>useds2;
bitset<N+1>vst[(N<<1)+1];
bitset<N+1>rst;
vector<int>E[N+1];
bool bfs()
{
	queue<int>q;
	int top;
	useds.set(),useds2.set();
	for (int i=1;i<=n;++i) depth[i]=0;
	for (int i=1;i<=n-1;++i)
		if (S1[i])
			useds[i]=0,depth[i]=1,q.push(i);
	while (!q.empty())
	{
		top=q.front(),q.pop();
		if (top<=n-1)
		{
			rst=useds2&B[top];
			for (int i=rst._Find_first();i!=useds2.size();i=rst._Find_next(i)) useds2[i]=0,depth[n-1+i]=depth[top]+1,q.push(n-1+i);
		}
		else
		{
			top-=(n-1);
			if (S2[top]) return 1;
			rst=useds&B2[top];
			for (int i=rst._Find_first();i!=useds.size();i=rst._Find_next(i)) useds[i]=0,depth[i]=depth[n-1+top]+1,q.push(i);
		}
	}
	return 0;
}
int dinic(int x)
{
	if (!x)
	{
		for (int i=S1._Find_first();i!=S1.size();i=S1._Find_next(i))
			if (dinic(i))
			{
				S1[i]=0;
				return 1;
			}
	}
	else if (x<=n-1)
	{
		for (int i=(B[x]&vst[depth[x]+1])._Find_first();i!=B[x].size();i=(B[x]&vst[depth[x]+1])._Find_next(i))
			if (dinic(n-1+i))
			{
				B[x][i]=0,B2[i][x]=1;
				return 1;
			}
	}
	else
	{
		x-=(n-1);
		if (S2[x])
		{
			S2[x]=0;
			return 1;
		}
		for (int i=(B2[x]&vst[depth[n-1+x]+1])._Find_first();i!=B2[x].size();i=(B2[x]&vst[depth[n-1+x]+1])._Find_next(i))
			if (dinic(i))
			{
				B2[x][i]=0,B[i][x]=1;
				return 1;
			}
	}
	return 0;
}
void topo_sort()
{
	int top;
	queue<int>q;
	for (int i=1;i<=n-1;++i) E[i].clear(),in[i]=0;
	for (int i=1;i<=n-1;++i)
		for (int j=1;j<=n-1;++j)
			if (rk[j][sp[i]]>rk[j][sp[j]])
				E[i].push_back(j),in[j]++;
	for (int i=1;i<=n-1;++i)
		if (!in[i])
			q.push(i);
	while (!q.empty())
	{
		top=q.front(),q.pop(),tong[++leng]=top;
		for (int i=0;i<E[top].size();++i)
		{
			in[E[top][i]]--;
			if (!in[E[top][i]]) q.push(E[top][i]);
		}
	}
	return;
}
int main()
{
	int res,x,y;
	n=read();
	for (int i=1;i<=n-1;++i)
		for (int j=1;j<=n;++j)
			a[i][j]=read(),rk[i][a[i][j]]=j;
	for (int i=1;i<=n;++i)
	{
		res=leng=0,S1.reset(),S2.reset();
		for (int j=1;j<=n-1;++j) S1[j]=1;
		for (int j=1;j<=n;++j) S2[j]=1,B[j].reset(),B2[j].reset();
		for (int j=1;j<=n-1;++j)
			for (int k=rk[j][i]+1;k<=n;++k)
				B[j][a[j][k]]=1;
		while (bfs())
		{
			for (int i=0;i<=(n<<1);++i) vst[i].reset();
			for (int i=1;i<=n-1;++i)
				if (depth[i])
					vst[depth[i]][i]=1;
			for (int i=1;i<=n;++i)
				if (depth[n-1+i])
					vst[depth[n-1+i]][i]=1;
			while (dinic(0)) res++;
		}
		if (res==n-1)
		{
			puts("Yes");
			for (int j=1;j<=n;++j) p[j]=B2[j]._Find_first();
			for (int j=1;j<=(n<<1);++j) vis[j]=0;
			for (int j=1;j<=n-1;++j) ps[j]=n;
			while (1)
			{
				x=0;
				for (int j=1;j<=n-1;++j)
					if (!vis[j])
					{
						x=j;
						break;
					}
				if (!x) break;
				for (int j=1;j<=n-1;++j)
					if (!vis[j])
					{
						while (vis[n-1+a[j][ps[j]]]) ps[j]--;
						cl[j]=a[j][ps[j]];
					}
				for (int j=1;j<=n-1;++j) used[j]=0;
				while (!used[x]) used[x]=1,x=p[cl[x]];
				y=x;
				do
				{
					sp[y]=cl[y],vis[y]=vis[n-1+cl[y]]=1,y=p[cl[y]];
				}
				while (x!=y);
			}
			topo_sort();
			for (int j=1;j<=n-1;++j) printf("%d ",tong[j]);
			puts("");
		}
		else puts("No");
	}
	return 0;
}