#include<bits/stdc++.h>
using namespace std;
int n,visit[105][105],a[105][105],ha,la,hb,lb,tx,ty;
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
bool ans=false;
void dfs(int x,int y){
	visit[x][y]=1;
	for(int i=0;i<=3;i++){
		tx=x+fx[i];
		ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=n&&a[tx][ty]==0&&visit[tx][ty]==0){
			if(tx==hb&&ty==lb){
				ans=true;
				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>>ha>>la>>hb>>lb;
	if(a[ha][la]==1||a[hb][lb]==1){
		cout<<"NO";
		return 0;
	}
	dfs(ha,la);
	if(ans==true) cout<<"YES";
	else cout<<"NO";
	return 0;
}
/**************************************************************
	Problem: 1430
	User: hongjiaming
	Language: C++
	Result: Accepted
	Time:20 ms
	Memory:2160 kb
****************************************************************/