#include<iostream>

#include<cstdio>

using namespace std;

const int MAXN=;

struct Edge{

  int next,to;

}e[MAXN*MAXN*];

int ecnt,head[MAXN];

inline void add(int x,int y){

  e[++ecnt].to = y;

  e[ecnt].next = head[x];

  head[x] = ecnt;

}

inline int rd(){

  int ret=,f=;char c;

  while(c=getchar(),!isdigit(c))f=c=='-'?-:;

  while(isdigit(c))ret=ret*+c-'',c=getchar();

  return ret*f;

}

int n;

int bl[MAXN],cnt;

int ins[MAXN],sta[MAXN],top;

int dfn[MAXN],low[MAXN],tot;

void tarjan(int x){

  dfn[x]=low[x]=++tot;ins[x]=;sta[++top]=x;

  for(int i=head[x];i;i=e[i].next){

    int v=e[i].to;

    // cout<<x<<" "<<v<<endl<<endl;

    if(!dfn[v]){

      tarjan(v);

      low[x]=min(low[x],low[v]);

    }else if(ins[v]){

      low[x]=min(low[x],dfn[v]);

    }

  }

  if(dfn[x]==low[x]){

    int elm;cnt++;

    do{

        elm = sta[top--];

        ins[elm] = false;

        bl[elm] = cnt;

    }while(elm != x);

  }

}

int main(){

  n=rd();int x;

  for(int i=;i<=n;i++)

    for(int j=;j<=n;j++)

      if(rd()) add(i,j);

  for(int i=;i<=n;i++) if(!dfn[i]) tarjan(i);

  if(cnt!=) return puts("NO"),;

  puts("YES");

  return ;

}