#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<vector>
#include<cstring>
#define N 500
#define SM 1000
#define K 2000000
#define rg register
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;
}
namespace HK
{
	const int Max_N(1005), Inf(1 << 30);
	int Nl, Nr, M, now, dis;
	int matchl[Max_N], matchr[Max_N], levell[Max_N], levelr[Max_N], visited[Max_N];
	int E[Max_N][Max_N], degree[Max_N];
	void clear()
	{
		Nl=Nr=M=now=dis=0;
		for (int i=0;i<Max_N;++i) matchl[i]=matchr[i]=levell[i]=levelr[i]=visited[i]=degree[i]=0;
		for (int i=0;i<Max_N;++i)
			for (int j=0;j<Max_N;++j)
				E[i][j]=0;
		return;
	}
	bool bfs()
	{
		static int queue[Max_N];
		for (int i=0;i<Max_N;++i) queue[i]=0;
		int* begin(queue);
		int* end(queue);
		bool res(false);
		for (int i(1); i <= Nl; ++i)
			if (matchl[i])
				levell[i] = 0;
			else
				levell[i] = 1, *end++ = i;
		for (int i(1); i <= Nr; ++i)
			levelr[i] = 0;
		while (begin != end)
		{
			int u(*begin++);
			for (int* e(E[u]); *e; ++e)
				if (levelr[*e] == 0)
				{
					levelr[*e] = levell[u] + 1;
					if (matchr[*e])
					{
						levell[matchr[*e]] = levelr[*e] + 1;
						*end++ = matchr[*e];
					}
					else
						res = true;
				}
		}
		return res;
	}

	bool dfs(int u)
	{
		for (int* e(E[u]); *e; ++e)
			if (levelr[*e] == levell[u] + 1 && visited[*e] != now)
			{
				visited[*e] = now;
				if (matchr[*e] == 0 || dfs(matchr[*e]))
				{
					matchr[*e] = u, matchl[u] = *e;
					return true;
				}
			}
		return false;
	}

	inline int HK()
	{
		int res(0);
		while (bfs())
		{
			++now;
			for (int i(1); i <= Nl; ++i)
				if (!matchl[i])
					res += dfs(i);
		}
		return res;
	}
}
struct node
{
	int v,data,nxt;
};
node edge[K+1];
int n,s,t,len,leng,tong[N+1],ps[N+1],cl[N+1],depth[SM+1],head[SM+1],cur[SM+1],rt[N+1],in[N+1],p[N+1],sp[N+1],a[N+1][N+1],rk[N+1][N+1];
bool used[SM+1],vis[SM+1];
vector<int>E[N+1];
void add(int x,int y,int z)
{
	edge[++len]=(node){y,z,head[x]},head[x]=len;
	edge[++len]=(node){x,0,head[y]},head[y]=len;
	return;
}
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 flow,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)
	{
		HK::clear(),HK::Nl=n-1,HK::Nr=n,res=leng=0;
		for (int j=1;j<=n-1;++j)
			for (int k=n;k>=rk[j][i]+1;--k)
				HK::E[j][HK::degree[j]++]=a[j][k];
		res=HK::HK();
		if (res==n-1)
		{
			puts("Yes");
			for (int j=1;j<=n-1;++j) p[HK::matchl[j]]=j;
			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;
}