#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> radj;
bool v1[2005];
bool v2[2005];
int c1;
int c2;
void dfs1(int v) {
  c1++;
  v1[v] = 1;
  for (auto u : adj[v]) {
    if (v1[u] == 0) {
      dfs1(u);
    }
  }
}
void dfs2(int v) {
  c2++;
  v2[v] = 1;
  for (auto u : radj[v]) {
    if (v2[u] == 0) {
      dfs2(u);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  adj.resize(n + 1);
  radj.resize(n + 1);
  int arr[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> arr[i][j];
    }
  }
  int node = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (arr[i][j] > 0) {
        adj[i + 1].push_back(j + 1);
        radj[j + 1].push_back(i + 1);
      }
      if (i == j && arr[i][j] > 0) {
        node = i + 1;
      }
    }
  }
  dfs1(node);
  dfs2(node);
  if (c1 == n && c2 == n) {
    cout << "YES";
  } else {
    cout << "NO";
  }
  return 0;
}
