#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 110,M = N*N;
int n,e[N][N],g[N][N];

int id[N][N],fa[M],tot;
int find(int x){
    return (fa[x] == x) ? (x) : (fa[x] = find(fa[x]));
}
void merge(int x,int y){
    fa[find(x)] = find(y);
}

int deg[N],qu[N],hd,rr,ans[N],cur;
void topo_sort(){
    hd = rr = 0; for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(g[i][j])deg[j]++;
    for(int i=1;i<=n;i++)if(!deg[i])qu[rr++] = i;
    cur = 0;
    while(hd<rr){
        int u = qu[hd++]; ans[u] = ++cur;
        for(int v=1;v<=n;v++)if(g[u][v]){
            deg[v]--;
            if(!deg[v])qu[rr++] = v;
        }
    }
    for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
    cout<<endl;
}

int main(){
    cin>>n;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i != j)id[i][j] = ++tot;
    iota(fa+1,fa+1+tot,1);
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)cin>>e[i][j];

    for(int x=1;x<=n;x++)for(int y=x+1;y<=n;y++){
        for(int z=1;z<=n;z++)if(z != x && z != y){
            if(e[x][z] == e[y][z] && e[x][z] != e[x][y]){
                merge(id[x][z],id[y][z]);
                merge(id[z][x],id[z][y]);
            }
        }
    }
    for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)if(find(id[i][j]) == find(id[j][i])){
        cout<<"NO\n";
        exit(0);
    }
    cout<<"YES\n";
    for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){
        if(find(id[i][j]) < find(id[j][i]))g[i][j] = 1;
        else g[j][i] = 1;
    }
    topo_sort();
    for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)if(!e[i][j]){
        g[i][j] ^= 1,g[j][i] ^= 1;
    }
    topo_sort();

    return 0;
}