#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<vector>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 100010

#define L 10000010

#define ul unsigned long long

int T,n,pre[N],suf[N],id[N];

ul hash[][L],p[L];

vector<char> s[N];

bool isac(char c){return c>='a'&&c<='z'||c>=''&&c<=''||c=='*';}

bool cmp(const int&a,const int&b)

{

    return pre[a]<pre[b];

}

bool check(int n)

{

    for (int i=;i<=n;i++) id[i]=i;

    sort(id+,id+n+,cmp);

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

        for (int j=;j<pre[id[i-]];j++)

        if (s[id[i-]][j]!=s[id[i]][j]) return ;

    return ;

}

ul gethash(int k,int l,int r)

{

    if (l>r) return ;

    return hash[k][r]-hash[k][l-]*p[r-l+];

}

int main()

{

#ifndef ONLINE_JUDGE

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

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

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    T=read();

    p[]=;for (int i=;i<=L-;i++) p[i]=p[i-]*;

    while (T--)

    {

        n=read();

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

        {

            s[i].clear();

            char c=getchar();while (!isac(c)) c=getchar();

            while (isac(c)) s[i].push_back(c),c=getchar();

        }

        hash[][]=;int len=;bool flag=;

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

        {

            int l=s[i].size();

            pre[i]=l,suf[i]=-;

            for (int j=;j<l;j++)

            if (s[i][j]=='*') {pre[i]=j;break;}

            for (int j=l-;~j;j--)

            if (s[i][j]=='*') {suf[i]=j;break;}

            if (pre[i]==l)

            if (!len)

            {

                len=l;

                for (int j=;j<l;j++) hash[][j+]=hash[][j]*+s[i][j];

            }

            else

            {

                ul tot=;

                for (int j=;j<l;j++) tot=tot*+s[i][j];

                if (tot!=hash[][len]) {flag=;break;}

            }

        }

        if (!flag) {cout<<"N\n";continue;}

        if (!len)

        {

            if (!check(n)) {cout<<"N\n";continue;}

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

            {

                reverse(s[i].begin(),s[i].end());

                pre[i]=(int)s[i].size()-suf[i]-;

            }

            if (!check(n)) {cout<<"N\n";continue;}

            cout<<"Y\n";

        }

        else

        {

            bool flag=;

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

            if (pre[i]!=s[i].size())

            {

                hash[][]=;

                int l=s[i].size();

                for (int j=;j<l;j++) hash[][j+]=hash[][j]*+s[i][j];

                if (pre[i]+l--suf[i]>len||gethash(,,pre[i])!=gethash(,,pre[i])||gethash(,len-l+suf[i]+,len)!=gethash(,suf[i]+,l)) {flag=;break;}

                int x=pre[i]+;flag=;

                for (int j=pre[i];j<=suf[i];j++)

                {

                    if (j==suf[i]) flag=;

                    if (s[i][j]=='*') continue;

                    int t=j;

                    while (s[i][t+]!='*') t++;

                    while (x+t-j<len-l+suf[i]+&&gethash(,x,x+t-j)!=gethash(,j+,t+)) x++;

                    if (x+t-j>=len-l+suf[i]+) break;

                    j=t;

                }

                if (flag) break;

            }

            if (flag) cout<<"N\n";else cout<<"Y\n";

        }

    }

    return ;

}