#include <bits/stdc++.h>
using namespace std;
const int block_size = 320;
const long long mod = 1e9 + 7;
const long long inf = 1e9 + 7;
const long double eps = 1e-9;
const double PI = atan(1) * 4;
template <typename T, typename S>
inline bool upmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
inline bool upmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
namespace SOLVE {
vector<vector<int> > edges;
vector<int> ids, low_link;
vector<int> on_stack;
stack<int> s;
int scc_count = 0;
int id = 0;
void dfs(int at) {
  s.push(at);
  on_stack[at] = 1;
  ids[at] = low_link[at] = id++;
  for (int to : edges[at]) {
    if (ids[to] == -1) {
      dfs(to);
      low_link[at] = min(low_link[at], low_link[to]);
    } else if (on_stack[to]) {
      low_link[at] = min(low_link[at], ids[to]);
    }
  }
  if (ids[at] == low_link[at]) {
    while (((int)s.size())) {
      low_link[s.top()] = ids[at];
      on_stack[s.top()] = 0;
      if (s.top() == at) {
        s.pop();
        break;
      }
      s.pop();
    }
    scc_count++;
  }
}
void main() {
  int n, temp;
  cin >> n;
  edges.resize(n);
  ids.resize(n, -1);
  on_stack.resize(n);
  low_link.resize(n, 10000);
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> temp;
      if (temp != 0) {
        edges[i].push_back(j);
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    if (ids[i] == -1) {
      dfs(i);
    }
  }
  if (scc_count == 1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
}  // namespace SOLVE
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) {
    SOLVE::main();
  }
  return 0;
}
