#include <cmath>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#define rep(i,l,r) for(int i=l;i<=r;i++)
using namespace std;

int n,m[410][410];
int v[410],y[410];

bool dfs(int x){
	rep(i,1,n) if(m[x][i]&&!v[i]){
			v[i]=1;
				if(!y[i]||dfs(y[i])){
					y[i]=x;
					return 1;
				}
		}
	return 0;
}

int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
			rep(i,1,n) rep(j,1,n) scanf("%d",&m[i][j]);
		rep(i,1,n) y[i]=0;int num=1;
		while(num<=n){
			rep(i,1,n) v[i]=0;
				if(dfs(num)) num++;
				else break;
		}
		if(num<=n) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}