#include <bits/stdc++.h>
using namespace std;
struct edge {
  int to, next;
} e[2002 * 2002];
int head[2002], cnte;
void add(int u, int v) {
  e[++cnte].to = v;
  e[cnte].next = head[u];
  head[u] = cnte;
}
int n, low[2002], dfn[2002], cntdfn, stk[2002], top, cntcyc;
bool incyc[2002];
void tarjan(int u) {
  low[u] = dfn[u] = ++cntdfn;
  stk[++top] = u;
  for (int i = head[u]; i; i = e[i].next) {
    int v = e[i].to;
    if (!dfn[v]) {
      tarjan(v);
      low[u] = min(low[u], low[v]);
    } else if (!incyc[v]) {
      low[u] = min(low[u], dfn[v]);
    }
  }
  if (dfn[u] == low[u]) {
    cntcyc++;
    int x;
    do {
      x = stk[top];
      top--;
      incyc[x] = 1;
    } while (x != u);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      int x;
      scanf("%d", &x);
      if (x) add(i, j);
    }
  for (int i = 1; i <= n; i++) {
    if (!dfn[i]) tarjan(i);
  }
  puts(cntcyc == 1 ? "YES" : "NO");
  return 0;
}
