#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<cmath>
#include<set>
using namespace std;
long long gcd(long long m,long long  n)
{     long long a=m,b=n;
    if(m==0) return n;
    long long k;
    k=m%n;
    while(k!=0)
    {
        m=n;
        n=k;
        k=m%n;
    }
    return n ;
}
bool mm(string s1,string s2)
{
    return s1<s2;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        long long  n;
        cin>>n;
        vector<string>s(n);
        long long cnt=0;
        for(int i=0;i<n;i++)
        {
            cin>>s[i];
            if(s[i].size()%2==0)
            cnt++;
        }
        sort(s.begin(),s.end(),mm);
        long long ans1=cnt*(n-cnt);
        long long ans2=n*(n-1)/2;

        long long cur=0;
        for(int i=0;i<n-1;i++)
        if(s[i]==s[i+1])
        {
          int mys=2;
          i++;
          while(i<n-1&&s[i]==s[i+1])
          {
              i++;
              mys++;
          }
          cur=cur+mys*(mys-1)/2;
        }
        ans1=ans1+cur;
        long long ms=gcd(ans1,ans2);
        if(ans1==0)
        cout<<"0/1"<<endl;
        else if(ans1==ans2)
         cout<<"1/1"<<endl;
        else cout<<ans1/ms<<"/"<<ans2/ms<<endl;;
    }
    return 0;
}