#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool memBeg;
template<typename T,typename TT> void chkmin(T &x,TT y) {if(x>y) x=y;}
template<typename T,typename TT> void chkmax(T &x,TT y) {if(x<y) x=y;}
constexpr int mod=998244353;
void inc(int &x,int y) {x+=y; x-=(x>=mod)*mod;}
void dec(int &x,int y) {x-=y; x+=(x<0)*mod;}
constexpr int add(int x,int y) {return (x+y>=mod)?x+y-mod:x+y;}
constexpr int sub(int x,int y) {return (x<y)?x-y+mod:x-y;}
constexpr int quick_pow(int x,ll times,int ret=1) {
    for(;times;times>>=1,x=1ll*x*x%mod) if(times&1) ret=1ll*ret*x%mod;
    return ret;
}
constexpr int maxn=105;
int n,a[maxn][maxn],fa[maxn*maxn];
int find(int x) {return fa[x]==x?x:fa[x]=find(fa[x]);}
int qhash(int i,int j) {return (i-1)*n+j;}
bool ban[maxn*maxn],ltx[maxn][maxn],lty[maxn][maxn];
vector<pair<int,int>> bel[maxn*maxn];
void work(bool lt[maxn][maxn],int *aim) {
    static int ideg[maxn],que[maxn];
    for(int i=1;i<=n;i++) ideg[i]=0;
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(lt[i][j]) ideg[j]++;
    int tead=0,rail=0;
    for(int i=1;i<=n;i++) if(!ideg[i]) que[rail++]=i;
    while(tead<rail) {
        int cur=que[tead++];
        for(int i=1;i<=n;i++) if(lt[cur][i]&&!--ideg[i]) que[rail++]=i;
    }
    assert(rail==n);
    for(int i=0;i<n;i++) aim[que[i]]=i+1;
}
int x[maxn],y[maxn];
bool memEn;
void fl() {
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
int main() {
    fprintf(stderr,"%.24lf\n",fabs(&memEn-&memBeg)/1024.0/1024.0);
    // fl();
    scanf("%d",&n);
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&a[i][j]);
    iota(fa+1,fa+n*n+1,1);
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            if(i==j) continue;
            for(int k=1;k<=n;k++) {
                if(i==k||j==k) continue;
                if(a[i][j]==a[i][k]&&a[i][j]!=a[j][k]) {
                    fa[find(qhash(i,j))]=find(qhash(i,k));
                    fa[find(qhash(j,i))]=find(qhash(k,i));
                }
            }
        }
    }
    for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) {
        if(find(qhash(i,j))==find(qhash(j,i))) return puts("NO"),0;
    }
    for(int i=n;i>=1;i--) {
        for(int j=n;j>=1;j--) {
            if(i==j) continue;
            bel[find(qhash(i,j))].emplace_back(i,j);
        }
    }
    for(int i=n;i>=1;i--) {
        for(int j=n;j>=1;j--) {
            if(i==j) continue;
            int x=find(qhash(i,j));
            if(ban[x]) continue;
            ban[x]=true;
            for(auto v:bel[x]) {
                int p,q; tie(p,q)=v;
                ltx[p][q]=true;
                ban[find(qhash(q,p))]=true;
            }
        }
    }
    for(int i=1;i<=n;i++) {
        for(int j=i+1;j<=n;j++) assert(ltx[i][j]!=ltx[j][i]);
    }
    work(ltx,x);
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            if(i==j) continue;
            if(a[i][j]) lty[i][j]=ltx[i][j];
            else lty[i][j]=!ltx[i][j];
        }
    }
    work(lty,y);
    puts("YES");
    for(int i=1;i<=n;i++) printf("%d%c",x[i]," \n"[i==n]);
    for(int i=1;i<=n;i++) printf("%d%c",y[i]," \n"[i==n]);
    return 0;
}