#include<bits/stdc++.h>
using namespace std;
int t,n,ha,la,hb,lb;
bool QQ[119][120];
bool kkk;
char cz[110][119];
void dfs(int a,int b){
	QQ[a][b]=1;
	if(a==hb&&b==lb){kkk=true;return;}
	if(QQ[a-1][b]==0&&a-1>=0) dfs(a-1,b);	
	if(QQ[a+1][b]==0&&a+1<n) dfs(a+1,b);
	if(QQ[a][b-1]==0&&b-1>=0) dfs(a,b-1);
	if(QQ[a][b+1]==0&&b+1<n) dfs(a,b+1);
}
int main(){
	cin>>t;
	for(int i=1;i<=t;i++){
        cin>>n;
		for(int j=0;j<n;j++){
			for(int k=0;k<n;k++){
				cin>>cz[j][k];
				if(cz[j][k]=='#') QQ[j][k]=1;
				else QQ[j][k]=0;
			}
		}
		cin>>ha>>la>>hb>>lb;
		QQ[ha][la]=1;
		dfs(ha,la);
		if(kkk==1) cout<<"Yes";
		else cout<<"No";
		cout<<endl;
        kkk=0;
	}
	return 0;
}