#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e2+10,V=N*N;
int n,m,a[N][N],id[N][N];
int p[N],q[N],cnt[N][2],fa[V];
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
bool merge(int x,int y){
	x=find(x),y=find(y);
	if(x==y)return 0;
	return fa[x]=y,1;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&a[i][j]);
			cnt[i][a[i][j]]++;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i^j)id[i][j]=++m;
		}
	}
	iota(fa,fa+1+m,0);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i==j)continue;
			int x=a[i][j];
			for(int k=j+1;k<=n;k++){
				if(a[i][k]!=x||j==k||i==k)continue;
				if(a[j][k]!=x){
					merge(id[i][j],id[i][k]);
					merge(id[j][i],id[k][i]);
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<i;j++){
			if(find(id[i][j])==find(id[j][i])){
				puts("NO"),exit(0);
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(a[i][j]){
				if(find(id[i][j])<find(id[j][i])){
					p[j]++,q[j]++;
				}else{
					p[i]++,q[i]++;
				}
			}else{
				if(find(id[i][j])<find(id[j][i])){
					p[j]++,q[i]++;
				}else{
					p[i]++,q[j]++;
				}
			}
		}
	}
	puts("YES");
	for(int i=1;i<=n;i++)printf("%d%c",p[i]+1,"\n "[i<n]);
	for(int i=1;i<=n;i++)printf("%d%c",q[i]+1,"\n "[i<n]);
	return 0;
}