//T1
//这么难的吗？？？
//........
//暴力搞来一发
//1hour left
//i am so nervous //不会写hash啊。。。老写炸。。
//那怎么判重啊/。。。
//Meide
//trie树？
//hhhh gg 

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<set>
using namespace std;const int N=55;int T,n;
struct STR
{bool flag;int len;int sum;string s;string ss[1000];
}str[N];inline int read()
{char c=getchar();int num=0,f=1;for(;!isdigit(c);c=getchar())f=c=='-'?-1:f;for(;isdigit(c);c=getchar())num=num*10+c-'0';return num*f;
}inline void mswap(char &a,char &b)
{char c=a;a=b;b=c;
}inline string reverse(string s,int a,int b)        //stl的reverse不会用。。
{string tmp=s;for(;a<=b;++a,--b){mswap(tmp[a],tmp[b]);}
//    cout<<"tmp: "<<tmp<<endl;return tmp;
}set<string> ma;
queue<string> que;
void bfs(STR &A)
{ma.clear();ma.insert(A.s);que.push(A.s);string now,tmp;int len=A.len;while(!que.empty()){now=que.front();
//        cout<<now<<endl;
        que.pop();for(int i=2;i<=len;++++i){tmp=reverse(now,0,i-1);if(ma.count(tmp))continue;que.push(tmp);A.ss[++A.sum]=tmp;ma.insert(tmp);}}
}int main()
{freopen("kahuucino.in","r",stdin);freopen("kahuucino.out","w",stdout);T=read();while(T--){n=read();int ans=n;for(int i=1;i<=n;++i)str[i].flag=str[i].sum=0;for(int i=1;i<=n;++i){cin>>str[i].s;
//            cout<<"aa: "<<str[i].s<<endl;str[i].ss[++str[i].sum]=str[i].s;str[i].len=str[i].s.length();bfs(str[i]);}bool flag;
//        printf("%d",str[1].sum);for(int i=1;i<=n;++i){if(str[i].flag)continue;for(int j=i+1;j<=n;++j){if(str[j].flag||str[i].len!=str[j].len)continue;flag=0;for(int k=1;k<=str[i].sum;++k){for(int l=1;l<=str[j].sum;++l){if(str[i].ss[k]==str[j].ss[l]){flag=1;str[i].flag=str[j].flag=1;----ans;break;}}if(flag)break;}if(flag)break;}}printf("%d\n",ans);}return 0;
}

// luogu-judger-enable-o2
//T1 正解
//为什么这么6的呢
//stl好用又简洁
//...代码真短 //因为不管怎么翻转，原串中挨着的两个字符第i和i+1个总挨在一起
//所以我们把原串分解成很多两个字母的组合
//让组合中的第一个字符的字典序<=第二个字符
//然后，把这好几个组合按字典序排序
//再把它们按排完序后的顺序组合起来
//set判断
//如果这个字符串以前出现过，那么就消掉，余下的字符串数量-2
//否则就扔进set里//貌似好简单的对吧
//但是为什么就想不到呢
//只想着打暴力了
//想也不定能想出来 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<vector>
using namespace std;const int N=55;int T,n;
set<string> se;
string S[N];
string s[N];
string tmp;inline int work()
{int len,ans=n;se.clear();for(int i=1;i<=n;++i){len=S[i].length();for(int j=0;j*2<len;++j){char x=S[i][j<<1],y=S[i][j<<1|1];if(x>y)swap(x,y);s[j]=x,s[j]+=y;}sort(s,s+len/2);tmp.clear();for(int j=0;j<len/2;++j)tmp+=s[j];if(len&1)tmp+=S[i][len-1];if(se.count(tmp)){se.erase(tmp);----ans;}elsese.insert(tmp);}return ans;
}string a;
int main()
{scanf("%d",&T);while(T--){scanf("%d",&n);for(int i=1;i<=n;++i)cin>>S[i];printf("%d\n",work());}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;const int N=1e5+5;int n;
long long ans,sum;
struct Yuk
{int u,v;bool operator < (const Yuk &a) const{return this->u==a.u?this->v>a.v:this->u<a.u;}
}yuk[N];inline int read()
{char c=getchar();int num=0,f=1;for(;!isdigit(c);c=getchar());f=c=='-'?-1:f;for(;isdigit(c);c=getchar())num=num*10+c-'0';return num*f;
}int main()
{n=read();for(int i=1;i<=n;++i){yuk[i].u=read(),yuk[i].v=read();}sort(yuk+1,yuk+n+1);for(int i=1;i<=n;++i){ans=max(ans,sum+yuk[i].u+yuk[i].v);if(yuk[i].u<yuk[i].v)sum+=yuk[i].v-yuk[i].u;}printf("%lld",ans);return 0;
}

//耗我两个半小时。。made
//写麻烦了，可以不开队列直接搞的
//没时间改了。。
//万一TLE
//那就很TM了吧 //跑得真慢
//样例都这么慢
//等着翻车
//别翻车啊... //竟然A了。。。
//又长又丑的代码
//懒得改它了。 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
using namespace std;const int N=505;int Q;
struct F
{bool flag;int tim;string name;
}file[N];
struct D
{bool flag;  //这个文件夹还在不在 int tim;    //文件夹创建时间 string name;    //文件夹名字 D *fa;        //父亲path D *wjj[N];        //sonsF *wj[N];    //file postionsint s1,s2;    //sum of dires and filesD *q1[N];F *q2[N];int h1,h2,t1,t2;
}dir[N<<1],Root;typedef D* W;
W null,now_d,now;
string opt,name;typedef F* H;
H now_f;inline void init()
{now_f=file;now_d=dir;now=&Root;now->h1=now->h2=1;now->t1=now->t2=0;now->fa=null;now->flag=1;now->name="Root";
}bool flag=0;
W t1;
H t2;
int main()
{freopen("nacumegu.in","r",stdin);freopen("nacumegu.out","w",stdout);init();scanf("%d",&Q);for(int i=1;i<=Q;++i){cin>>opt;
//        cout<<opt<<endl;if(opt=="ls"){
//            cout<<now->t1<<" "<<now->t2<<endl;
//            cout<<now->h1<<" "<<now->h2<<endl;while(1){if(now->h1>now->t1||now->h2>now->t2)break;t1=now->q1[now->h1],t2=now->q2[now->h2];if(t1->flag==0){++(now->h1);continue;}else if(t2->flag==0){++(now->h2);continue;}if(t1->tim<t2->tim){cout<<t1->name<<" <D>"<<'\n';++(now->h1);}else{cout<<t2->name<<" <F>"<<'\n';++(now->h2);}}while(now->h1<=now->t1){t1=now->q1[now->h1];if(!t1->flag){++(now->h1);continue;}
//                printf("%s <D>\n",now->q1[now->h1]->name);cout<<t1->name<<" <D>"<<'\n';++(now->h1);}while(now->h2<=now->t2){t2=now->q2[now->h2];if(!t2->flag){++(now->h2);continue;}
//                printf("%s <F>\n",now->q2[now->h2]->name);cout<<t2->name<<" <F>"<<'\n';++(now->h2);}now->h1=now->h2=1;continue;}cin>>name;
//        cout<<opt<<" "<<name<<endl;if(opt=="cd"){if(name==".."){if(now->fa==null)puts("No parent directory!");elsenow=now->fa;}else{flag=0;for(int j=1;j<=now->s1;++j){if(now->wjj[j]->flag&&now->wjj[j]->name==name){now=now->wjj[j];flag=1;break;}}if(!flag)puts("No such directory!");}}else if(opt=="touch"){flag=0;for(int j=1;j<=now->s2;++j){if(now->wj[j]->flag&&now->wj[j]->name==name){flag=1;break;}}if(!flag){++now_f;now_f->flag=1;now_f->tim=i;now_f->name=name;now->wj[++now->s2]=now_f;now->q2[++now->t2]=now_f;}elseputs("File already exists!");}else if(opt=="rm"){flag=0;for(int j=1;j<=now->s2;++j){if(now->wj[j]->flag&&now->wj[j]->name==name){flag=1;now->wj[j]->flag=0;now->wj[j]->name="";break;}}if(!flag)puts("No such file!");}else if(opt=="mkdir"){flag=0;for(int j=1;j<=now->s1;++j){if(now->wjj[j]->flag&&now->wjj[j]->name==name){flag=1;break;}}if(flag)puts("Directory already exists!");else{++now_d;now_d->tim=i;now_d->fa=now;now_d->name=name;now_d->flag=1;now_d->h1=now_d->h2=1;now_d->t1=now_d->t2=0;now->wjj[++now->s1]=now_d;now->q1[++now->t1]=now_d;}}else if(opt=="rmdir"){flag=0;for(int j=1;j<=now->s1;++j){if(now->wjj[j]->flag&&now->wjj[j]->name==name){flag=1;now->wjj[j]->flag=0;now->wjj[j]->name="";break;}}if(!flag)puts("No such directory!");}}fclose(stdin);fclose(stdout);return 0;
}
/*
20
mkdir 123
cd 123
rm 123
cd ..
rm 123
rmdir 12
rmdir 123
cd 123
ls
*//*
20
cd ..
mkdir 123
mkdir 456
mk 123
mk 456
ls
touch 123
touch 456
ls
rmdir 456
mkdir 456
ls
cd 123
ls
touch mhe
touch why
cd ..
ls
*/