#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__uint128_t;
const int N=5e2+5,M=N*8+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,A[N][N],mch[N],pre[N];
bitset<N> B[N],vis;
int dfs(int x){
	while(1){
		int p=(B[x]&vis)._Find_first();
		if(p>n) break;
		vis[p]=0;
		if(!mch[p]||dfs(mch[p])) return mch[p]=x,pre[x]=p,1;
	}
	return 0;
}
int Get(){
	fill(mch+1,mch+n+1,0);fill(pre+1,pre+n+1,0);
	for(int i=1;i<n;i++){
		for(int j=1;j<=n;j++) if(B[i][j]&&!mch[j]) {mch[j]=i;pre[i]=j;break;}
	}
	for(int i=1;i<n;i++)if(!pre[i]){
		vis.set();if(!dfs(i)) return 0;
	}
	return 1;
}
int R[N],op[N],del[N],p[N],v[N];
void construct(){
	int Ct=n-1,i,j;
	for(i=1;i<=n;i++) R[i]=n,op[i]=del[i]=0;
	while(Ct){
		int LC=Ct;
		for(i=1;i<n;i++) if(!del[i]) while(op[A[i][R[i]]]) R[i]--;
		int x=0;for(i=1;i<n;i++) if(!del[i]) p[pre[i]]=A[i][R[i]],x=pre[i];
		Me(v,0);
		for(i=1;i<=2*n&&v[x]<=2;i++) v[x]++,x=p[x];
		for(i=1;i<n;i++) if(!del[i]&&v[A[i][R[i]]]>=2&&v[pre[i]]>=2) del[i]=1,op[A[i][R[i]]]=1,printf("%d ",i),Ct--;
		assert(Ct<LC);
	}
	printf("\n");
}
void Solve(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<n;i++) for(j=1;j<=n;j++) scanf("%d",&A[i][j]);
	for(i=1;i<=n;i++){
		for(j=1;j<n;j++) B[j].reset();
		for(j=1;j<n;j++) for(h=n;h;h--) if(A[j][h]^i) B[j][A[j][h]]=1;else break;
		if(!Get()) {puts("No");continue;}
		puts("Yes");
		construct();
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}