#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
int T,n;
struct mat{
	LL a[4][4];
	mat operator*(const mat&b)const{
		mat c;
		memset(c.a,0,sizeof(a));
		rep(i,0,n-1)rep(j,0,n-1)rep(k,0,n-1){
			c.a[i][j]+=a[i][k]*b.a[k][j];
		}
		return c;
	}
	bool operator==(const mat&rhs)const{
		rep(i,0,n-1)rep(j,0,n-1)if(a[i][j]!=rhs.a[i][j])return 0;
		return 1;
	}
	void add_row(int i,int j,LL k){
		rep(t,0,n-1){
			a[j][t]+=a[i][t]*k;
		}
	}
	void add_col(int i,int j,LL k){
		rep(t,0,n-1){
			a[t][j]+=a[t][i]*k;
		}
	}
	void swap_row(int i,int j){swap(a[i],a[j]);}
	void swap_col(int i,int j){rep(k,0,n-1)swap(a[k][i],a[k][j]);}
	void print(){
		rep(i,0,n-1){
			rep(j,0,n-1)D("%lld ",a[i][j]);
			D("\n");
		}
		D("\n");
	}
};
void exgcd(LL a,LL b,LL&x,LL&y){
	if(!b){x=1,y=0;return;}
	exgcd(b,a%b,y,x);
	y-=a/b*x;
}
LL inv(LL x,LL m){
	LL v0,v1;
	exgcd(x,m,v0,v1);
	v0=(v0%m+m)%m;
	assert(1LL*v0*x%m==1);
	return v0;
}
void solve(){
	cin>>n;
	mat A,I;
	memset(A.a,0,sizeof(A));
	memset(I.a,0,sizeof(I));
	rep(i,0,n-1){
		rep(j,0,n-1){
			cin>>A.a[i][j];
			I.a[i][j]=i==j;
		}
	}
	mat A0=A;
	mat B(I),C(I);
	// (B*A*C).print();
	LL det=1;
	rep(i,0,n-1){
		if(!A.a[i][i]){
			rep(j,i+1,n-1)if(A.a[j][i]){
				A.swap_row(i,j);
				B.swap_col(i,j);
				det=-det;
				break;
			}
			if(!A.a[i][i]){
				puts("No");
				return;
			}
		}
		rep(j,i+1,n-1){
			while(1){
				if(abs(A.a[i][i])<abs(A.a[j][i])){
					A.swap_row(i,j);
					B.swap_col(i,j);
					det=-det;
				}
				if(!A.a[j][i])break;
				LL t=A.a[i][i]/A.a[j][i];
				A.add_row(j,i,-t);
				B.add_col(i,j,t);
			}
		}
		det*=A.a[i][i];
	}
	if(det<=0){
		puts("No");
		return;
	}
	
	LL val=sqrt(det+0.5);
	if(val*val!=det){
		puts("No");
		return;
	}
	per(i,n-1,0){
		LL t=abs(__gcd(val,A.a[i][i]));
		rep(j,i+1,n-1){
			if(A.a[i][j]%t!=0){
				LL tmp=inv((A.a[j][j]%t+t)%t,t)*(A.a[i][j]%t)%t;
				A.add_row(j,i,-tmp);
				B.add_col(i,j,tmp);
			}
		}
		rep(j,0,n-1){
			assert(A.a[i][j]%t==0);
			A.a[i][j]/=t;
			B.a[j][i]*=t;
		}
		val/=t;
	}
	assert(A0==(B*A*C));
	puts("Yes");
	rep(i,0,n-1)rep(j,0,n-1)printf("%lld%c",B.a[i][j],j==n-1?'\n':' ');
	rep(i,0,n-1)rep(j,0,n-1)printf("%lld%c",A.a[i][j],j==n-1?'\n':' ');
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	cin>>T;
	rep(tc,1,T){
		solve();
	}
	return 0;
}