#include<bits/stdc++.h>
using namespace std;
int a[105][105],n,aa,bb,ha,hb,visit[105][105],ans=0;
int fx[4]={0,1,0,-1};
int fy[4]={-1,0,1,0};
void dfs(int x,int y){
	visit[x][y]=1;
	for(int i=0;i<n;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(a[tx][ty]==0&&tx>0&&tx<=n&&ty>0&&ty<=n&&visit[tx][ty]==0){
			visit[tx][ty]=1;
			if(tx==ha&&ty==hb){
				ans=1;
				return;
			}
			dfs(tx,ty);
			
		}
	}
} 
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
		}
	}
	cin>>aa>>bb>>ha>>hb;
	if(a[aa][bb]==1||a[ha][hb]==1) cout<<"NO";
	dfs(aa,bb);
	if(ans==1) cout<<"YES";
	else cout<<"NO";
	return 0;
}
/**************************************************************
	Problem: 1430
	User: houshanglin
	Language: C++
	Result: Wrong Answer
****************************************************************/