#include <bits/stdc++.h>
typedef long long ll ;
#define int ll
const int MAX=1e3+10;
const int modn=1e9+7;
const int INF=0x3f3f3f3f3f3f;
#define endl '\n'
#define cwk     freopen("D:\\workplace\\CLion\\in.in","r",stdin),freopen("D:\\workplace\\CLion\\out.out","w",stdout)
using namespace std;
int n,m;
char aa[MAX][MAX],bb[MAX][MAX];
int a[MAX][MAX],b[MAX][MAX];
string s;
bool check_hang(int m) {
    bool is=(a[m][1]==b[m][1]);
    for (int i = 2; i <= n; i++) {
        if (is!=(a[m][i] == b[m][i])) {
            return false;
        }
    }
    return true;
}
bool check_lie(int m) {
    bool is=(a[1][m]==b[1][m]);
    for (int i = 2; i <= n; i++) {
        if (is!=(a[i][m] == b[i][m])) {
            return false;
        }
    }
    return true;
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>aa[i][j];
            a[i][j]=aa[i][j]-'0';
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>bb[i][j];
            b[i][j]=bb[i][j]-'0';
        }
    }
    if(!check_hang(1)){
        for(int i=1;i<=n;i++){
            if(a[1][i]!=b[1][i]){
                for(int j=1;j<=n;j++){
                    a[j][i]^=1;
                }
            }
        }
        for(int i=2;i<=n;i++){
            if(!check_hang(i)){
                cout<<"NO\n";
                return;
            }
        }
        cout<<"YES\n";
        return;
    }
    bool is=true;
    for(int i=2;i<=n;i++){
        if(!check_hang(i)) is=false;
    }
    if(is){
        cout<<"YES\n";
        return;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            a[j][i]^=1;
        }
    }
    for(int i=2;i<=n;i++){
        if(!check_hang(i)){
            cout<<"NO\n";
            return;
        }
    }
    cout<<"YES\n";

}
signed main() {
    //ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    //cwk;
    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}