#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,b[2001][2001],a[2001][2001];
bool check(int x,int y){
	return a[x][y]^a[x-1][y-1]^a[x-1][y]^a[x-2][y-1];
}
void solve(){
	for(int i=3;i<=n;i++){
		int x=check(i,2);
		for(int j=3;j<i;j++){
			if(x!=check(i,j)) return;
		}
		// if(x) update(i);
	}
	cout<<"Yes",exit(0);
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=i;j++){
			char sb;
			cin>>sb;
			a[i][j]=sb-'0';
		}
	}
	solve();
	a[1][1]^=1;
	solve();
	a[2][1]^=1,a[2][2]^=1;
	solve();
	a[1][1]^=1;
	solve();
	return 0;
}