#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

int n,g[405][405],m,id[405][405];

int fa[maxn];
int getf(int x){
	while(x^fa[x])x=fa[x]=fa[fa[x]];
	return x;
}
void merge(int x,int y){
	if(x<y)swap(x,y);
	x=getf(x),y=getf(y);
	if(x!=y)fa[x]=y;
}
bool vis[405][405];
int ans[maxn],p[405],q[405],deg[405],degq[405];

signed main()
{
	n=read();
	For(i,1,n)
		For(j,i+1,n)
			id[i][j]=++m,id[j][i]=m+n*(n-1)/2;
	iota(fa+1,fa+m*2+1,1);
	For(i,1,n)For(j,1,n)g[i][j]=read();
	For(i,1,n)
		For(j,1,n)if(i!=j)
			For(k,1,n)if(k!=i&&k!=j){
				if(g[i][j]==g[j][k] && g[i][j]!=g[i][k]){
				//	cout<<"i,j,k "<<i<<" "<<j<<" "<<k<<endl;
					merge(id[i][j],id[k][j]);
					merge(id[j][i],id[j][k]);
				}
			}
	For(i,1,m) if(getf(i)==getf(i+m)) puts("NO"),exit(0);
	puts("YES");
	For(i,1,n) p[i]=i;
	For(i,1,m+m) ans[i]=-1;
	For(i,1,m)
		if(ans[i]==-1 && getf(i)==i){
			ans[i]=1;
			ans[getf(i+m)]=0;
		}
	For(i,1,n)
		For(j,1,n){
			if(i==j)continue;
			int dir=ans[getf(id[i][j])];
			deg[i]+=dir;
		}
	For(i,1,n) p[i]=deg[i]+1,q[i]=1;
	For(i,1,n)
		For(j,i+1,n){
			int dq=(!g[i][j])^(p[i]>p[j]);
			q[i]+=dq;
			q[j]+=(!dq);
		}
	For(i,1,n)cout<<p[i]<<" \n"[i==n];
	For(i,1,n)cout<<q[i]<<" \n"[i==n];
	return 0;
}