#include<bits/stdc++.h>
#define pd push_back
#define all(A) A.begin(),A.end()
#define lb lower_bound
#define ve std::vector
typedef long long ll;
typedef long long ll;
typedef __int128 Int;
typedef unsigned long long ul;
typedef long double LD;
bool FileIfstream(std::string name){
	std::ifstream f(name.c_str());
	return f.good();
}
namespace Math{
	ll QP(ll x,ll y,ll mod){ll ans=1;for(;y;y>>=1,x=x*x%mod)if(y&1)ans=ans*x%mod;return ans;}
	ll inv(ll x,ll mod){return QP(x,mod-2,mod);}
}
const int N=2e5+10;
const int mod=998244353;
int f[N];
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
void merge(int x,int y){
	x=find(x),y=find(y);
	if(x==y)return;
	if(x>y)std::swap(x,y);
	f[y]=x;
}
void solve(){
	//don't forget to open long long
	int n;std::cin>>n;
	ve<ve<int>>v(n+1,ve<int>(n+1));
	auto Gid=[&](int x,int y)->int{return (x-1)*n+y;};
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			std::cin>>v[i][j];
	for(int i=1;i<=n*n;i++)f[i]=i;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			for(int k=1;k<=n;k++)
				if(v[i][j]==v[i][k]&&v[i][j]==!v[j][k])
					merge(Gid(i,j),Gid(i,k)),merge(Gid(j,i),Gid(k,i));
	ve<ve<int>>val(n+1,ve<int>(n+1));
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++){
			int x=find(Gid(i,j)),y=find(Gid(j,i));
			if(x==y)return std::cout<<"NO\n",void();
			val[i][j]=x<y;val[j][i]=x>y;
		}
	std::cout<<"YES\n",void();
	ve<int>p,q;
	for(int i=1;i<=n;i++)p.pd(i),q.pd(i);
	sort(all(p),[&](auto x,auto y){return val[x][y];});
	sort(all(q),[&](auto x,auto y){return val[x][y]^v[x][y]^1;});
	ve<std::array<int,2>>per(n+1);
	for(int i=1;i<=n;i++)
		per[p[i-1]][0]=i,per[q[i-1]][1]=i;
	for(int i=1;i<=n;i++)std::cout<<per[i][0]<<(i==n?'\n':' ');
	for(int i=1;i<=n;i++)std::cout<<per[i][1]<<(i==n?'\n':' ');
}
int main(){
#ifndef ONLINE_JUDGE
	if(!FileIfstream("IO.in")){
		freopen("IO.in","w",stdout);
		return 0;
	}
	freopen("IO.in","r",stdin);
	freopen("IO.out","w",stdout);
#endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	int T=1;
	//std::cin>>T;
	while(T--)solve();

	return 0;
}