// This file is made by YJinpeng，created by XuYike's black technology automatically.

// Copyright (C) 2016 ChangJun High School, Inc.

// I don't know what this program is.

#include <iostream>

#include <vector>

#include <algorithm>

#include <cstring>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#define MOD 1000000007

#define INF 1e9

using namespace std;

typedef long long LL;

const int MAXN=100010;

const int MAXM=100010;

inline int gi() {

	register int w=0,q=0;register char ch=getchar();

	while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();

	if(ch=='-')q=1,ch=getchar();

	while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar();

	return q?-w:w;

}

struct Hungarian_dfs{

    static const int N=110;

    int cnt,n;

    int match[N],a[N],c[N];

    vector<int>b[N];int f[N];

    inline void add(int u,int v){b[u].push_back(v);}

    bool dfs(int x){

        if(f[x]==cnt)return 0;

        int num=b[x].size();f[x]=cnt;

        for(int i=0;i<num;i++){

            int nex=b[x][i];

            if(match[nex]==-1||dfs(match[nex])){

                match[x]=nex;match[nex]=x;return 1;

            }

        }

        return 0;

    }

    void Work(){

        int T=gi();

        while(T--){

            n=gi();int now=0;

            for(int i=1;i<=n;i++)a[i]=gi(),b[i].clear();

            for(int i=1;i<=n;i++){

                c[i]=gi()?a[i]:0;

                if(!c[i])now++;

                if(a[i])add(i,i+n);

            }

            for(int i=1;i<=n;i++)

                for(int j=1;j<=n;j++)

                    if(gi()&&a[j])add(i,j+n);//gi()放前面 逻辑短路

            memset(f,false,sizeof(f));int ans=0;

            for(int i=1;i<N;i++)match[i]=-1;

            for(int i=1;i<=n;i++)

                if(match[i]==-1&&!c[i]){

                    ++cnt;if(dfs(i))++ans;else break;

                }

            printf(ans==now?"^_^\n":"T_T\n");

        }

    }

}d;

int main()

{

	freopen("2347.in","r",stdin);

	freopen("2347.out","w",stdout);

	d.Work();

	return 0;

}