#include <bits/stdc++.h>
using namespace std;
vector<int> conn[2005], rconn[2005];
bool visited[2005];
int sta[2005], top, mark[2005], color;
void dfs(int idx) {
  visited[idx] = true;
  for (int i = 0; i < conn[idx].size(); ++i)
    if (!visited[conn[idx][i]]) dfs(conn[idx][i]);
  sta[top++] = idx;
}
void rdfs(int idx) {
  visited[idx] = true;
  mark[idx] = color;
  for (int i = 0; i < rconn[idx].size(); ++i)
    if (!visited[rconn[idx][i]]) rdfs(rconn[idx][i]);
}
void Kosaraju(int n) {
  int i;
  memset(visited, 0, sizeof(bool) * n);
  for (i = top = 0; i < n; ++i)
    if (!visited[i]) dfs(i);
  memset(visited, 0, sizeof(bool) * n);
  for (i = top - 1, color = 0; i >= 0; --i)
    if (!visited[sta[i]]) rdfs(sta[i]), ++color;
}
int a[2005][2005];
int main() {
  int i, j, k;
  int n, m;
  scanf("%d", &n);
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      scanf("%d", &a[i][j]);
      if (i != j && a[i][j] > 0) {
        conn[i].push_back(j);
        rconn[j].push_back(i);
      }
    }
  }
  color = 0;
  Kosaraju(n);
  if (color > 1)
    puts("NO");
  else
    puts("YES");
}
