#include<bits/stdc++.h>
using namespace std;
int n,ha,la,hb,lb,a[105][105],visit[105][105];
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++){
        int tx=x+fx[i],ty=y+fy[i];
        if(tx>=1&&tx<=n&&ty>=1&&ty<=n&&visit[tx][ty]==0&&a[tx][ty]==0){
            if(tx==hb&&ty==lb){
                ans=true;
				return;
            }
            visit[tx][ty]=1;
            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) cout<<"YES";
    else cout<<"NO";
}

/**************************************************************
	Problem: 1430
	User: panyuchen
	Language: C++
	Result: Accepted
	Time:18 ms
	Memory:2160 kb
****************************************************************/