#include<bits/stdc++.h>
#define ll long long
#define rep(i,l,r) for(int i(l),i##end(r);i<=i##end;++i)
#define per(i,r,l) for(int i(r),i##end(l);i>=i##end;--i)
using namespace std;
const int N=120;
int n,e[N][N],id[N][N],fa[N*N],o1[N*N],o2[N*N],p[N],q[N];
int find(int x){ return x==fa[x]?x:fa[x]=find(fa[x]); }
void merge(int x,int y){
    x=find(x),y=find(y);
    if(x^y) fa[x]=y;
}
mt19937 rnd(19937);
unsigned int rk[N*N];
signed main(){
    // freopen("my.in","r",stdin);
    scanf("%d",&n);
    rep(i,1,n) rep(j,1,n) scanf("%d",&e[i][j]);

    int m=0;
    rep(i,1,n) rep(j,1,n){
        if(i^j){
            id[i][j]=++m;
            o1[m]=i,o2[m]=j;
        }
    }
    rep(i,1,m) fa[i]=i;

    rep(x,1,n){
        rep(y,1,n) if(x^y){
            rep(z,y+1,n) if(x^z){
                if(e[x][y]==e[x][z]&&e[y][z]!=e[x][y]){
                    merge(id[x][y],id[x][z]);
                    merge(id[y][x],id[z][x]);
                }
            }
        }
    }
    rep(i,1,n) rep(j,i+1,n) if(find(id[i][j])==find(id[j][i])) return puts("NO"),0;
    rep(i,1,n) rep(j,1,n){
        if((i^j)&&find(id[i][j])>find(id[j][i])){
            p[j]++,q[e[i][j]?j:i]++;
        }
    }
    puts("YES");
    rep(i,1,n) printf("%d ",p[i]+1); puts("");
    rep(i,1,n) printf("%d ",q[i]+1); puts("");
    return 0;
}