#include <bits/stdc++.h>
using namespace std;
const int oo = 1061109567;
const double EPS = 1e-9;
int v[2003];
int r[2003];
vector<int> adj[2003];
vector<int> rdj[2003];
void DFS(int x) {
  if (v[x]) return;
  v[x] = 1;
  for (int i = 0; i < adj[x].size(); ++i) {
    if (!v[adj[x][i]]) DFS(adj[x][i]);
  }
}
void RFS(int x) {
  if (r[x]) return;
  r[x] = 1;
  for (int i = 0; i < rdj[x].size(); ++i) {
    if (!r[rdj[x][i]]) RFS(rdj[x][i]);
  }
}
int main() {
  int n, a;
  scanf("%d", &n);
  for (int i = 0; i < int(n); ++i) {
    for (int j = 0; j < int(n); ++j) {
      scanf("%d", &a);
      if (a) {
        adj[i].push_back(j);
        rdj[j].push_back(i);
      }
    }
  }
  DFS(0);
  RFS(0);
  int ans = 1;
  for (int i = 0; i < int(n); ++i) {
    if (v[i] == 0 || r[i] == 0) ans = 0;
  }
  if (ans == 0) {
    puts("NO");
  } else {
    puts("YES");
  }
}
