#include<stdio.h>

#include<stdlib.h>

#include<math.h>

#include<queue>

#include<string.h>

#include<iostream>

#include<vector>

using namespace std;

#define maxn 560

__int64 map[maxn][maxn];

__int64 P[maxn][maxn], n;

bool Judge()

{

    __int64 i, j, sum;

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

    {

        if(map[i][i])

            return ;

        for(j = ; j<i; j++)

        {

            sum = map[i][j] ^ map[j][i];

            if(sum)

                return ;

        }

    }

    memset(P,,sizeof(P));

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

    {

        P[i][i] = ;

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

            P[i][j] = P[i][j-]^map[j-][j];

    }

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

    {

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

        {

            if(i% ==  && j% == )//(a^b)&(a&b)

                sum = P[i][j]&(map[i][j]);

            else if(i% ==  && j% == )//(a^b)&(~(a|b))

                sum = P[i][j]&(~map[i][j]);

            else//(a^b)^(a^b)

                sum = P[i][j]^map[i][j];

            if(sum)

                return ;

        }

    }

    return ;

}

int main()

{

    int i, j;

    while(scanf("%I64d",&n) != EOF)

    {

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

        {

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

                scanf("%I64d",&map[i][j]);

        }

        if(Judge())

            printf("YES\n");

        else

            printf("NO\n");

    }

    return ;

}