#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MAXN = 105;
int n, a[MAXN][MAXN], qu[MAXN], hd, tl, rx[MAXN], ry[MAXN], in[MAXN];
vector<int> g[MAXN];
int get_id(int x, int y) { return (x - 1) * n + y; }
namespace dsu {
int fa[MAXN * MAXN];
void init(int n) { iota(fa + 1, fa + n + 1, 1); }
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
void merge(int x, int y) { fa[find(x)] = find(y); }
}  // namespace dsu
void topo_sort() {
  fill(in + 1, in + n + 1, 0);
  for (int i = 1; i <= n; ++i)
    for (auto j : g[i]) ++in[j];
  hd = 1;
  tl = 0;
  for (int i = 1; i <= n; ++i)
    if (!in[i]) qu[++tl] = i;
  while (hd <= tl) {
    int u = qu[hd++];
    for (auto v : g[u])
      if (!(--in[v])) qu[++tl] = v;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) cin >> a[i][j];
  dsu::init(n * n);
  for (int i = 1; i <= n; ++i) {
    for (int x = 1; x <= n; ++x) {
      if (x == i) continue;
      for (int y = x + 1; y <= n; ++y) {
        if (y == i) continue;
        if (a[i][x] == a[i][y] && a[x][y] != a[i][x]) {
          dsu::merge(get_id(i, x), get_id(i, y));
          dsu::merge(get_id(x, i), get_id(y, i));
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n; ++j) {
      if (dsu::find(get_id(i, j)) == dsu::find(get_id(j, i))) {
        cout << "NO\n";
        return 0;
      }
      if (dsu::find(get_id(i, j)) < dsu::find(get_id(j, i))) {
        g[i].emplace_back(j);
      } else {
        g[j].emplace_back(i);
      }
    }
  }
  topo_sort();
  for (int i = 1; i <= n; ++i) rx[qu[i]] = i;
  for (int i = 1; i <= n; ++i) g[i].clear();
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n; ++j) {
      if ((rx[i] > rx[j]) ^ a[i][j]) {
        g[i].emplace_back(j);
      } else {
        g[j].emplace_back(i);
      }
    }
  }
  topo_sort();
  for (int i = 1; i <= n; ++i) ry[qu[i]] = i;
  cout << "YES\n";
  for (int i = 1; i <= n; ++i) cout << rx[i] << " \n"[i == n];
  for (int i = 1; i <= n; ++i) cout << ry[i] << " \n"[i == n];
  return 0;
}
/*
g++ H.cpp -o H -std=c++14 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/