#include <bits/stdc++.h>
#pragma GCC target("sse4.2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long MAXN = 2 * 1000 + 7, MOD = 1000 * 1000 * 1000 + 7;
bool m[MAXN][MAXN], mark[MAXN];
vector<long long> adj[MAXN][2];
void dfs(long long v, bool c) {
  mark[v] = 1;
  for (auto u : adj[v][c])
    if (!mark[u]) dfs(u, c);
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.tie(nullptr);
  ;
  long long n, x;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> x;
      m[i][j] = (x > 0 ? 1 : 0);
      if (m[i][j]) {
        adj[i][0].push_back(j);
        adj[j][1].push_back(i);
      }
    }
  }
  dfs(0, 0);
  long long sum = 0;
  for (long long i = 0; i < n; i++) sum += mark[i], mark[i] = 0;
  if (sum != n) return cout << "NO" << endl, 0;
  dfs(0, 1);
  sum = 0;
  for (long long i = 0; i < n; i++) sum += mark[i];
  if (sum != n) return cout << "NO" << endl, 0;
  return cout << "YES" << endl, 0;
}
