#include <iostream>
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define REP(i,n) for(long long i=1; i<=n; i++)
#define rep(i,a,b) for(long long i=a; i<b; i++)
#define REPV(v) for(auto i = v.begin(); i != v.end(); ++i)
#define sort(arr) sort(arr.begin(),arr.end())
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define minArr(arr) *min_element(arr.begin(),arr.end())
#define maxArr(arr) *max_element(arr.begin(), arr.end())
#define findArr(arr,val) find(arr.begin(), arr.end(),val)
#define deb(a,s) cout<<a<<" "<<s<<endl
#define debV(v) for(auto x: v)printf("%lld ",x)
#define reverse(v) reverse(v.begin(),v.end())
#define printMatrix(mat) rep(i,0,mat.size()){rep(j,0,mat[i].size())cout<<mat[i][j]<<" ";cout<<endl;}
#define printMap(m) for(auto it:m)cout<<it.first<<" "<<it.second<<endl;
using namespace std;

typedef long long ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef unsigned long int uli;
typedef vector<vector<ll>> matrix;

const ll MOD = 1e9+7;

void xorMat(vector<vii> &matA,bool col,ll n, int index){
	if(col){
		rep(i,0,n){
			matA[i][index]^=1;
		}
	}else{
		rep(i,0,n){
			matA[index][i]^=1;
		}
	}
}

bool matchMAt(vector<vii> matA, vector<vii> matB, ll n,map<int,int> &colXor){

	rep(i,0,n)rep(j,0,n){
		if(matA[i][j] != matB[i][j]){
			if(colXor[j]==0){
				xorMat(matA,true,n,j);
				colXor[j]++;
			}else if(j==0){
				xorMat(matA,false,n,i);
			}else{
				return false;
			}
		}else{
			colXor[j]++;
		}
	}
	return true;
}

void solve() {

	ll n=1,a=1,k=1,minVal=LLONG_MAX,maxVal=LLONG_MIN,ans=LLONG_MAX,b=1,c=1,d=1;
	ll x,y,z,lx,rx,ly,ry,p,q,l,r,m,i,w;
	lx = 0,ly=0,rx=INT_MAX,ry=INT_MAX;
	cin>>n;

	vector<vii> matA(n, vii(n));
	vector<vii> matB(n, vii(n));
	map<int,int> colXor;

	string s;

	rep(i,0,n){
		cin>>s;
		rep(j,0,n)
		matA[i][j] = (int) s[j];
	}
	rep(i,0,n){
		cin>>s;
		rep(j,0,n)
		matB[i][j] = (int) s[j];
	}
	
	if(matchMAt(matA,matB,n,colXor))printf("%s\n","YES");
	else printf("%s\n","NO");
	
}

int main() {
	// your code goes here
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);	
	freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

	int t=1;
	string str;
	cin >> t;
	int i=1;
	//seiveFactorize(2*(1e5+1));
	while (t) {
		//cout<<"Case "<<i<<": ";
		solve();
		i++;
		t--;
	}
	return 0;
}