#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
LL A[5][5], L[5][5], R[5][5];
void rswap(int i, int j) {
    for(int k = 0; k < n; k++) {
        swap(A[i][k], A[j][k]); swap(L[k][i], L[k][j]);
    }
    for(int k = 0; k < n; k++) {
        A[i][k] *= -1; L[k][i] *= -1;
    }
}
void cswap(int i, int j) {
    for(int k = 0; k < n; k++) {
        swap(A[k][i], A[k][j]); swap(R[i][k], R[j][k]);
    }
    for(int k = 0; k < n; k++) {
        A[k][i] *= -1; L[i][k] *= -1;
    }
}
void raddmul(int i, int j, LL t) {
    for(int k = 0; k < n; k++) {
        A[i][k] += A[j][k] * t;
        L[k][j] -= L[k][i] * t;
    }
}
void caddmul(int i, int j, LL t) {
    for(int k = 0; k < n; k++) {
        A[k][i] += A[k][j] * t;
        R[j][k] -= R[i][k] * t;
    }
}

void rreduce(int i, int j) {
    if(A[i][i] != 0 && A[j][i] % A[i][i] == 0) {
        raddmul(j, i, -A[j][i] / A[i][i]);
        return;
    }
    while(A[j][i] != 0) {
        raddmul(i, j, -A[i][i] / A[j][i]);
        rswap(i, j);
    }
}
void creduce(int i, int j) {
    if(A[i][i] != 0 && A[i][j] % A[i][i] == 0) {
        caddmul(j, i, -A[i][j] / A[i][i]);
        return;
    }
    while(A[i][j] != 0) {
        caddmul(i, j, -A[i][i] / A[i][j]);
        cswap(i, j);
    }
}

void reduce(int m) {
    bool ok;
    do {
        for(int i = 0; i < m - 1; i++) rreduce(m - 1, i);
        for(int i = 0; i < m - 1; i++) creduce(m - 1, i);
        ok = true;
        for(int i = 0; i < m - 1; i++) if(A[m - 1][i] != 0 || A[i][m - 1] != 0) ok = false;
    } while(!ok);
}

int X[5], Y[5];
void solve() {
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++) {
            scanf("%lld", &A[i][j]);
            L[i][j] = R[i][j] = i == j;
        }
    
    for(int i = n; i >= 1; i--) reduce(i);

    LL prod = 1;
    for(int i = 0; i < n; i++) prod *= A[i][i];
    if(prod <= 0) {
        printf("No\n"); return;
    }
    LL ss = sqrt(prod + 0.5);
    if(ss * ss != prod) {
        printf("No\n"); return;
    }
    for(int i = 0; i < n; i++) {
        LL g = __gcd(ss, A[i][i]);
        X[i] = g;
        Y[i] = A[i][i] / g;
        ss /= g;
    }

    printf("Yes\n");
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++)
            printf("%lld ", L[i][j] * X[j]), assert(L[i][j] * X[j] <= 1e18);
        printf("\n");
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++)
            printf("%lld ", R[i][j] * Y[i]), assert(R[i][j] * Y[i] <= 1e18);
        printf("\n");
    }
}
int main() {
    int T;
    scanf("%d", &T);
    while(T--) solve();
    return 0;
}