//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mid ((l+r)>>1)
#define lowbit(x) (x&-x)
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=105;
int n,ct,p[N],q[N],a[N][N],id[N][N],fa[N*N];
inline int find(int x){return (x==fa[x])?(x):(fa[x]=find(fa[x]));}
inline void merge(int x,int y){fa[find(x)]=find(y);}
inline void solve(){
    cin>>n;
    rep(i,1,n) rep(j,1,n) cin>>a[i][j];
    rep(i,1,n) rep(j,1,n) if (i^j) id[i][j]=++ct;
    rep(i,1,ct) fa[i]=i;
    rep(i,1,n) rep(j,1,n) rep(k,1,n){
        if (i==j || i==k || j==k || a[i][k]!=a[i][j] || a[j][k]==a[i][j]) continue;
        merge(id[i][j],id[i][k]),merge(id[j][i],id[k][i]);
    }
    rep(i,1,n) rep(j,1,i-1)
        if (find(id[i][j])==find(id[j][i])) return cout<<"NO\n",void();
    cout<<"YES\n";
    rep(i,1,n) p[i]=q[i]=1;
    rep(i,1,n) rep(j,i+1,n)
        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];
        }
    rep(i,1,n) cout<<p[i]<<' ';cout<<'\n';
    rep(i,1,n) cout<<q[i]<<' ';cout<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
    return 0;
}