#include<iostream>
#include<cstdio>
#include<algorithm>
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 110;
int n, f[10010], p[N], q[N], ans1[N], ans2[N];
bool a[N][N], v[N][N];
inline int id(int x, int y) {return (x - 1) * n + y - 1;}
int find(int x) {return x == f[x] ? x : f[x] = find(f[x]);}
inline bool cmp(int x, int y) {return v[x][y];}
inline void merge(int x, int y) {f[find(x)] = find(y);}

int main(){
    scanf("%d", &n);
    rep(i, 1, n) rep(j, 1, n){
        scanf("%d", &a[i][j]);
        f[id(i, j)] = id(i, j);
    }
    rep(i, 1, n) rep(j, 1, n) rep(k, 1, n)
        if(a[i][j] == a[i][k] && a[i][k] == 1-a[j][k])
            merge(id(i, j), id(i, k)), merge(id(j, i), id(k, i));
    rep(i, 1, n) rep(j, i + 1, n){
        if(find(id(i, j)) == find(id(j, i))){
            puts("NO"); return 0;
        }
        v[i][j] = find(id(i, j)) < find(id(j, i));
        v[j][i] = !v[i][j];
    }
    puts("YES");
    rep(i, 1, n) p[i] = i, q[i] = i;
    sort(p + 1, p + n + 1, cmp);
    rep(i, 1, n) rep(j, i + 1, n){
        // printf("pre: %d %d %d\n", i, j, v[i][j]);
        v[i][j] ^= a[i][j] ^ 1;
        // printf("now: %d %d %d\n", i, j, v[i][j]);
        v[j][i] = !v[i][j];
    }
    sort(q + 1, q + n + 1, cmp);
    rep(i, 1, n) ans1[p[i]] = i, ans2[q[i]] = i;
    rep(i, 1, n) printf("%d ", ans1[i]); puts("");
    rep(i, 1, n) printf("%d ", ans2[i]); puts("");
    return 0;
}