#include <cstring>
#include <cmath>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cassert>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <vector>
#include <bitset>
#include <utility>

#define all(x) (x).begin(), (x).end()
#define bit(x) (1 << (x))
#define cnt1(x) (__builtin_popcount(x))
#define LB lower_bound
#define LET(it,v) __typeof(v) it(v)
#define mset0(x) memset((x), 0, sizeof((x)))
#define mset1(x) memset((x), -1, sizeof((x)))
#define pb push_back
#define PQ priority_queue
#define REP(it,v) for(LET(it,v.begin());it!=v.end();it++)
#define sqr(x) ((x)*(x))
#define sz(x) ((int)(x.size()))
#define UB upper_bound
#define X first
#define Y second

using namespace std;
typedef long long LL;
typedef double DB;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;

template <class T> inline void chkmin(T &a, T b) {
    if (b < a) a = b;
}
template <class T> inline void chkmax(T &a, T b) {
    if (a < b) a = b;
}

#define MXLEN 305                         // &#44396;&#54616;&#47140;&#45716;  &#50472;&#49688;&#51032;  &#51088;&#47532;&#49688;   
#define MN 8                             // &#44596; &#50745;&#44540;&#49688;&#50504;&#51032; &#54620;&#44060;&#50745;&#44540;&#49688;&#51032; &#44600;&#51060;  
#define BIGLEN MXLEN*5 / 8               // &#44596;&#50745;&#44540;&#49688;&#50504;&#51032; &#50745;&#44540;&#49688; &#44060;&#49688; 
#define MX 1000005                    
#define MOD 100000000    
#define BG BIG_INTEGER  
#define rep(i, n) for (int i = 0; i < n; i ++)

using namespace std;

typedef long long LL;

const char inputString[] = " ,.?abcdefghijklmnopqrstuvwxyz";
const int AT = strlen(inputString);
char s[MX];      // plaintext

int count_number(LL k);                

int MAX(int a, int b) {
    if (a < b) return b;
    return a;
}

int val(char c) {
    return strchr(inputString, c) - inputString;
}

char re_val(int k) {
    return inputString[k];
}

struct BIG_INTEGER{
    int n;
    LL a[BIGLEN];
    void init() {
        n = 1; 
        a[0] = 0;
    }
    void input() {
        scanf("%s", s);
        int i, j, len;
        n = 0; len = strlen(s);
        for (i = len - 1; i >= 0; i -= MN) {
            a[n] = 0;
            for (j = MAX(i - MN + 1, 0); j <= i; j ++) a[n] = a[n] * 10 + s[j] - '0';
            n ++;
        }
    }
    void print() {
        int i, j, k;
        for (i = n - 1; i >= 0; i --) {
            if (i == n - 1) {
                printf("%lld", a[i]);
                continue;
            }
            k = count_number(a[i]);
            for (j = 0; j < MN - k; j ++) cout << "0";
            printf("%lld", a[i]);
        }
        puts("");
    }
    void Reverse() {
        reverse(a, a + n);
    }
    void push_head() {
        while (a[n - 1] >= MOD) {
            a[n] = a[n - 1] / MOD;
            a[n - 1] %= MOD;
            n ++;
        }
    } 
    void push_all() {
        LL mod(0), i, sum;
        for (i = 0; i < n; i ++) {
            sum = mod + a[i];
            a[i] = sum % MOD;
            mod = sum / MOD;
        }
        if (mod) {
            a[n ++] = mod;
            push_head();
        }
    }
    void pop() {
        while (n && !a[n - 1]) n --;
        if (!n) n = 1;
    }
    void remove() {
        rep(i, n) {
            if (a[i] >= 0) continue;
            a[i] = MOD + a[i];
            a[i + 1] --;
        }
    }
    void valueof(LL k) {
        init();
        a[0] = k;
        push_head();
    }    
    int count() {return (n - 1) * MN + count_number(a[n - 1]);}
    LL convert() {
        LL res = 0;
        rep(i, n) res = res * MOD + a[n - 1 - i];
        return res;
    }
    BG operator + (const BG &A) const { 
        BG res;
        res.n = MAX(A.n, n);
        rep(i, res.n) {
            res.a[i] = 0;
            if (i < n) res.a[i] += a[i];
            if (i < A.n) res.a[i] += A.a[i];
        }
        res.push_all();
        return res;
    }
    BG operator * (const BG &A) const {
        BG res;
        res.n = A.n + n - 1;
        int i;
        for (i = 0; i < res.n; i ++) res.a[i] = 0;
        for (i = 0; i < n; i ++) rep(j, A.n) res.a[i + j] += a[i] * A.a[j];
        res.push_all();
        res.pop();
        return res;
    }
    BG operator - (const BG &A) const {
        BG res;
        res.n = n;
        int i;
        for (i = 0; i < n; i ++) res.a[i] = a[i];
        for (i = 0; i < A.n; i ++) res.a[i] -= A.a[i];
        res.remove();
        res.push_all();
        res.pop();
        return res;
    }
    bool operator == (const BG &A) const {
        if (n != A.n) return 0;
        rep(i, n) if (a[i] != A.a[i]) return 0;
        return 1;
    }
    bool operator != (const BG &A) const {
        if (n != A.n) return 1;
        rep(i, n) if (a[i] != A.a[i]) return 1;
        return 0;
    }
    bool operator < (const BG &A) const {
        if (n != A.n) return n < A.n;
        for (int i = n - 1; i >= 0; i --) if (a[i] != A.a[i]) return a[i] < A.a[i];
        return 0;
    }
    void divide(LL k) {
        LL mod(0);
        for (int i = n - 1; i >= 0; i --) {
            a[i] = mod*MOD + a[i];
            mod = a[i] % k;
            a[i] /= k;
        }
        pop();
    }
    void copy(const BG &A) {
        n = A.n;
        rep(i, n) a[i] = A.a[i];
    }
    int mod_integer(int p) {
        if (p == 5) return a[0] % 5;
        LL mod(0), sum;
        int i;
        for (i = n - 1; i >= 0; i --) {
            sum = a[i] + mod*MOD;
            mod = sum % p;
        }            
        return mod;
    }    
    void multiply(int k) {
        LL mod(0);
        rep(i, n) {
            a[i] = a[i] * k + mod;
            mod = a[i] / MOD;
            a[i] %= MOD;
        }
        if (mod) {
            a[n ++] = mod;
            push_head();
        }
    }
    BG Multiply(int k) {
        LL mod(0);
        BG res;
        res.n = n;
        rep(i, n) {
            res.a[i] = a[i] * k + mod;
            mod = res.a[i] / MOD;
            res.a[i] %= MOD;
        }
        if (mod) {
            res.a[res.n ++] = mod;
            res.push_head();
        }
        return res;
    }
    void add(LL k) {
        a[0] += k;
        push_all();
    }
    BG Get_mod(BG &A) {
        BG res, cur, B;
        res.n = 0; cur.init();
        int i;
        LL st, en, mid;
        for (i = n - 1; i >= 0; i --) {
            cur.multiply(MOD);
            cur.add(a[i]);
            if (cur < A) {
                res.a[res.n ++] = 0;
                continue;
            }
            st = 1; en = MOD - 1;
            while (st < en) {
                mid = (st + en + 1) / 2;
                B = A.Multiply(mid);
                if (cur < B) en = mid - 1;     
                else if (cur == B) {
                    st = mid;
                    break;
                }
                else st = mid;
            }
            res.a[res.n ++] = st;
            cur = cur - A.Multiply(st);
        }        
        res.Reverse();        
        res.pop();
        copy(res);
        return cur;
    }
    void fromString(char *s) {
        int len = strlen(s);
        n = 1; a[0] = 0;
        rep(i, len) {
            multiply(AT);
            add(val(s[i]));
        }
    }
    void toString(char *s) {
        int cnt(0);
        while (1) {
            if (n == 1 && !a[0]) break;
            s[cnt ++] = re_val(mod_integer(AT));
            divide(AT);
        }
        s[cnt] = 0;
        reverse(s, s + cnt);    
    }
}ONE, ZERO;

BG pow_mod(BG A, BG B, BG C) {
    A.copy(A.Get_mod(C));
    BG rlt, cur;
    rlt.copy(ONE);
    while (1) { 
        if (B == ZERO) return rlt;
        if (B.a[0] % 2) {
            cur.copy(rlt * A);
            rlt.copy(cur.Get_mod(C));
        }
        cur = A*A;
        A.copy(cur.Get_mod(C));
        B.divide(2);
    }    
    return rlt;
}

int count_number(LL k) {
    if (k == 0) return 1;
    int res(0);
    while (k) res ++, k /= 10;
    return res;
}

int BG_init() {
    ZERO.init();
    ONE.init(); ONE.a[0] = 1;
}

BIG_INTEGER a[105];

int main() {
    
    BG_init();
    int T;
    int i, n;
    
    for (scanf("%d", &T); T--; ) {
        scanf("%d", &n);
        for (i = 1; i <= n; i++) a[i].input();
        if (n == 1) {
            puts("Yes");
            continue;
        }
        
        int cnt = 0;
        for (i = 1; i <= n; i++) {
            if (a[i] == ZERO) cnt++;
        }
        
        if (cnt == n) {
            puts("Yes");
            continue;
        }
        if (cnt > 0 && cnt < n) {
            puts("No");
            continue;
        }
        
        for (i = 2; i < n; i++) {
            if (a[i - 1] * a[i + 1] != a[i] * a[i]) break;
        }
        if (i < n) puts("No");
        else puts("Yes");
    }
    
    return 0;
}