#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t>
void print_single(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

template<class t,class u>
void print_single(const pair<t,u>&p,int suc=1){
	print_single(p.a,2);
	print_single(p.b,suc);
}

template<class T>
void print_single(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print_single(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print_single(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print_single(const array<T,N>&v,int suc=1){
	rep(i,N)
		print_single(v[i],i==int(N)-1?suc:2);
}

template<class T>
void print(const T&t){
	print_single(t);
}

template<class T,class ...Args>
void print(const T&t,const Args&...args){
	print_single(t,2);
	print(args...);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
//#define CAPITAL
/*
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}*/
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int topbit(ull t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int botbit(ull a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
int popcount(ull t){
	return __builtin_popcountll(t);
}
int bitparity(ll t){
	return __builtin_parityll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}
ull umask(int i){
	return (ull(1)<<i)-1;
}
ll minp2(ll n){
	if(n<=1)return 1;
	else return ll(1)<<(topbit(n-1)+1);
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	//#ifdef LOCAL
	static mt19937_64 gen;
	/*#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif*/
	return uniform_int_distribution<ll>(l, r)(gen);
}

ll rand_int(ll k){ //[0,k)
	return rand_int(0,k-1);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}
template<class t>
bool bis(const vc<t>&v,const t&a){
	return binary_search(all(v),a);
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

template<class t>
vc<t> presum(const vc<t>&a){
	vc<t> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
vc<ll> presum(const vi&a){
	vc<ll> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
//BIT で数列を管理するときに使う (CF850C)
template<class t>
vc<t> predif(vc<t> a){
	gnr(i,1,si(a))a[i]-=a[i-1];
	return a;
}
template<class t>
vvc<ll> imos(const vvc<t>&a){
	int n=si(a),m=si(a[0]);
	vvc<ll> b(n+1,vc<ll>(m+1));
	rep(i,n)rep(j,m)
		b[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];
	return b;
}

//verify してないや
void transvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void transvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[j][i]=a[i][j];
	}
	a.swap(b);
	transvvc(n,m,args...);
}
//CF854E
void rotvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void rotvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[m-1-j][i]=a[i][j];
	}
	a.swap(b);
	rotvvc(n,m,args...);
}

//ソートして i 番目が idx[i]
//CF850C
template<class t>
vi sortidx(const vc<t>&a){
	int n=si(a);
	vi idx(n);iota(all(idx),0);
	sort(all(idx),[&](int i,int j){return a[i]<a[j];});
	return idx;
}
//vs[i]=a[idx[i]]
//例えば sortidx で得た idx を使えば単にソート列になって返ってくる
//CF850C
template<class t>
vc<t> a_idx(const vc<t>&a,const vi&idx){
	int n=si(a);
	assert(si(idx)==n);
	vc<t> vs(n);
	rep(i,n)vs[i]=a[idx[i]];
	return vs;
}
//CF850C
vi invperm(const vi&p){
	int n=si(p);
	vi q(n);
	rep(i,n)q[p[i]]=i;
	return q;
}

template<class t,class s=t>
s SUM(const vc<t>&a){
	return accumulate(all(a),s(0));
}

template<class t>
t MAX(const vc<t>&a){
	return *max_element(all(a));
}

template<class t>
pair<t,int> MAXi(const vc<t>&a){
	auto itr=max_element(all(a));
	return mp(*itr,itr-a.bg);
}

template<class t>
t MIN(const vc<t>&a){
	return *min_element(all(a));
}

template<class t>
pair<t,int> MINi(const vc<t>&a){
	auto itr=min_element(all(a));
	return mp(*itr,itr-a.bg);
}

vi vid(int n){
	vi res(n);iota(all(res),0);
	return res;
}

template<class S>
void soin(S&s){
	sort(all(s));
}

template<class S>
S soout(S s){
	soin(s);
	return s;
}

template<class S>
void rein(S&s){
	reverse(all(s));
}

template<class S>
S reout(S s){
	rein(s);
	return s;
}

template<class t,class u>
pair<t,u>&operator+=(pair<t,u>&a,pair<t,u> b){
	a.a+=b.a;a.b+=b.b;return a;}
template<class t,class u>
pair<t,u>&operator-=(pair<t,u>&a,pair<t,u> b){
	a.a-=b.a;a.b-=b.b;return a;}
template<class t,class u>
pair<t,u> operator+(pair<t,u> a,pair<t,u> b){return mp(a.a+b.a,a.b+b.b);}
template<class t,class u>
pair<t,u> operator-(pair<t,u> a,pair<t,u> b){return mp(a.a-b.a,a.b-b.b);}

template<class t>
t gpp(vc<t>&vs){
	assert(si(vs));
	t res=move(vs.back());
	vs.pop_back();
	return res;
}

template<class t>
void pb(vc<t>&a,const vc<t>&b){
	a.insert(a.ed,all(b));
}

template<class t>
vc<t> cat(vc<t> a,const vc<t>&b){
	pb(a,b);
	return a;
}

template<class t,class u>
vc<t>& operator+=(vc<t>&a,u x){
	for(auto&v:a)v+=x;
	return a;
}

template<class t,class u>
vc<t> operator+(vc<t> a,u x){
	return a+=x;
}

template<class t,class u>
vc<t>& operator-=(vc<t>&a,u x){
	for(auto&v:a)v-=x;
	return a;
}

template<class t,class u>
vc<t>& operator-(vc<t> a,u x){
	return a-=x;
}

//最大重み max matching
//K 本のマッチングが求めたいなら whlie(arg()) のあたりをいじる
//min l[i]=Z とし、l'[i]=l[i]-Z とおくと、
//min sum l'[i] + sum r[i] + K*Z s.t. l'[i] + r[j] + Z >= C(e(i,j))
//の解になっている
//ちなみにこれは K 本の最大重みマッチングの双対問題
//マッチングは to,ot から得られる
//マッチングの辺では l'[i] + r[j] + Z = C(e(i,j)) が成り立つはず
//左頂点数を N 右頂点数を M 辺数を E マッチングサイズを S としたとき，O(S(E+S(N+M))) くらいかな
//定数倍は軽いと思う
//多重辺があっても動くはず（未検証）
//VERIFY: yosupo
template<class E,class D>
struct hungarian{
	int n,m;
	const vvc<E>&g;
	vc<D> l,r,q;
	vi to,ot,p;
	vc<char> lu,ru;
	int sz=0;
	D ans=0;
	void L(int i){
		lu[i]=1;
		for(auto e:g[i])if(!ru[e.to]){
			D w=l[i]+r[e.to]-e.cost;
			if(q[e.to]>w){
				p[e.to]=i;
				q[e.to]=w;
			}
		}
	}
	bool arg(){
		fill(all(p),-1);
		fill(all(q),inf);
		fill(all(lu),0);
		fill(all(ru),0);
		rep(i,n)if(to[i]==-1)L(i);
		while(1){
			int x=-1;
			rep(i,m)if(!ru[i]&&p[i]!=-1&&(x==-1||q[x]>q[i]))x=i;
			if(x==-1)return 0;
			D w=q[x];
			rep(i,n)if(lu[i])l[i]-=w;
			rep(i,m)if(ru[i])r[i]+=w;else if(p[i]!=-1)q[i]-=w;
			if(ot[x]==-1){
				while(x!=-1){
					ot[x]=p[x];
					swap(to[ot[x]],x);
				}
				sz++;
				return 1;
			}
			ru[x]=1;
			L(ot[x]);
		}
	}
	hungarian(int nn,int mm,const vvc<E>&gg):n(nn),m(mm),g(gg),
		l(n),r(m),q(m),to(n,-1),ot(m,-1),p(m),lu(n),ru(m){
		D mx=-inf;
		rep(i,n)for(auto e:g[i])chmax(mx,e.cost);
		fill(all(l),mx);
		while(arg())chmax(ans,get());
	}
	D get(){
		D mn=*min_element(all(l));
		return accumulate(all(l),accumulate(all(r),(-n+sz)*mn));
	}
};
struct E{
	int to,cost;
};

bool dbg=false;

using B=bitset<510>;

struct bipartite64{
	const int n,m;
	vc<B> g;
	vi to,ot;
	int sz;
	bipartite64(int nn,int mm):n(nn),m(mm),g(n),to(n,-1),ot(m,-1),sz(0){}
	void ae(int i,int j){
		assert(inc(0,i,n-1));
		assert(inc(0,j,m-1));
		g[i][j]=true;
	}
	void match(int i,int j){
		to[i]=j;
		ot[j]=i;
	}
	B Runvis;
	bool dfs(int v){
		while(1){
			int x=(Runvis&g[v])._Find_first();
			if(x<m){
				Runvis[x]=false;
				if(ot[x]==-1||dfs(ot[x])){
					match(v,x);
					return true;
				}
			}else break;
		}
		return false;
	}
	void trymatch(int i,int j){
		if(to[i]==-1&&g[i][j]&&ot[j]==-1){
			match(i,j);
			sz++;
		}
	}
	void calc(){
		rep(i,n)rep(j,m)trymatch(i,j);
		//dmp(to);
		//dmp(ot);
		rep(i,n)if(to[i]==-1){
			Runvis.set();
			if(dfs(i))sz++;
		}
	}
};

void slv(){
	int n;
	if(dbg){
		n=-10;
	}else{
		cin>>n;
	}
	bool gen=n<0;
	if(gen)n=-n;
	vvc<int> a(n-1);
	rep(i,n-1){
		if(gen){
			vi p=vid(n);
			myshuffle(p);
			//rotate(p.bg,p.bg+i,p.ed-1);
			a[i]=p;
		}else{
			a[i]=readvi(n,-1);
		}
	}
	vvc<E> g(n-1);
	rep(i,n-1)rep(j,n)g[i].pb({a[i][j],j});
	hungarian<E,int> h(n-1,n,g);
	vvc<int> b(n-1);
	rep(i,n-1)b[i]=invperm(a[i]);
	rep(tar,n){
		{
			bool bad=false;
			rep(i,n-1)if(a[i].back()==tar)bad=true;
			if(bad){
				No(0);
				continue;
			}
		}
		//dmp(tar);
		auto en=[&](int v){
			return v<tar?v:v-1;
		};
		auto de=[&](int v){
			return v<tar?v:v+1;
		};
		bipartite64 z(n-1,n-1);
		rep(i,n-1){
			bool ok=false;
			rep(j,n){
				if(a[i][j]==tar)ok=true;
				else if(ok){
					//dmp2(i,en(a[i][j]));
					z.ae(i,en(a[i][j]));
				}
			}
		}
		rep(i,n-1){
			int j=h.to[i];
			if(j!=tar)z.trymatch(i,de(j));
		}
		z.calc();
		//dmp(z.sz);
		if(z.sz==n-1){
			Yes(0);
			//continue;
			vi to(n-1);
			rep(i,n-1)to[i]=de(z.to[i]);
			vi ot(n,-1);
			rep(i,n-1)ot[to[i]]=i;
			auto modify=[&](int i,int j){
				swap(to[i],to[j]);
				swap(ot[to[i]],ot[to[j]]);
			};
			vi pos(n-1,-1);
			//row j needs to be done before row i?
			/*auto need=[&](int i,int j){
				return b[i][to[i]]<b[i][to[j]];
			};*/
			vc<bool> done(n-1);
			auto getnx=[&](int v)->int{
				assert(!done[v]);
				chmax(pos[v],b[v][to[v]]+1);
				while(pos[v]<n){
					int u=ot[a[v][pos[v]]];
					if(!done[u])return u;
					pos[v]++;
				}
				return -1;
			};
			vi ans;
			vc<bool> inst(n-1);
			vi st;
			auto append=[&](int v){
				inst[v]=true;
				st.pb(v);
			};
			//dmp(tar);
			rep(root,n-1)while(!done[root]){
				//dmp(a);
				//dmp(to);
				append(root);
				while(si(st)){
					//dmp(st);
					//dmp(inst);
					//dmp(done);
					int nx=getnx(st.back());
					if(nx==-1){
						int i=gpp(st);
						ans.pb(i);
						inst[i]=false;
						done[i]=true;
					}else if(inst[nx]){
						per(p,si(st)){
							if(st[p]==nx){
								rng(i,p,si(st)-1){
									modify(st[i],st[i+1]);
								}
								rng(i,p,si(st)){
									inst[st[i]]=false;
								}
								st.resize(p);
								break;
							}
						}
					}else{
						append(nx);
					}
				}
			}
			print(ans+1);
			if(0){
				vc<bool> elim(n);
				for(auto i:ans){
					per(j,n){
						int v=a[i][j];
						if(!elim[v]){
							elim[v]=true;
							break;
						}
					}
				}
				assert(!elim[tar]);
			}
		}else{
			No(0);
		}
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	if(dbg){
		while(1)slv();
	}else{
		//int t;cin>>t;rep(_,t)
		slv();
	}
}