#include <bits/stdc++.h>
using namespace std;
using db = double;
using lb = long double;
using ull = unsigned long long;
using uint = unsigned int;
using ll = long long;
// using i128 = __int128;
// using ui128 = unsigned __int128;
#define REP(i, first, last) for (int i = (first); i <= (last); ++i)
#define DOW(i, first, last) for (int i = (first); i >= (last); --i)
#define int long long
#define pb emplace_back
#define ob pop_back
#define pii pair<int, int>
#define MPR make_pair
#define fi first
#define se second
#define tpl tuple<int, int, int>
#define MTP make_tuple
#define poly vector<int>
#define polyp vector<pii>
#define polyt vector<tpl>
#define all(x) x.begin(), x.end()
#define CVR(a, q) memset(a, q, sizeof a)
#define CLR(a) memset(a, 0, sizeof a)
#define CPY(a, q) memcpy(a, q, sizeof a)
#define PCT __builtin_popcount
const int N = 1e6 + 5, M = 1e6 + 5;
const int mod1 = 1e9 + 7, mod2 = 998244353, mod = 1e9 + 7;
const long long inf = 1e18;
const int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n, cnt[50];
unordered_map<string, int> id;
int C[140][140];
void init() {
  id["1m"] = 1;
  id["2m"] = 2;
  id["3m"] = 3;
  id["4m"] = 4;
  id["5m"] = 5;
  id["6m"] = 6;
  id["7m"] = 7;
  id["8m"] = 8;
  id["9m"] = 9;
  id["1s"] = 10;
  id["2s"] = 11;
  id["3s"] = 12;
  id["4s"] = 13;
  id["5s"] = 14;
  id["6s"] = 15;
  id["7s"] = 16;
  id["8s"] = 17;
  id["9s"] = 18;
  id["1p"] = 19;
  id["2p"] = 20;
  id["3p"] = 21;
  id["4p"] = 22;
  id["5p"] = 23;
  id["6p"] = 24;
  id["7p"] = 25;
  id["8p"] = 26;
  id["9p"] = 27;
  id["1c"] = 28;
  id["2c"] = 29;
  id["3c"] = 30;
  id["4c"] = 31;
  id["5c"] = 32;
  id["6c"] = 33;
  id["7c"] = 34;
  REP(i, 0, 136) {
    C[i][0] = 1;
    REP(j, 1, min(i, 14ll))
    C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
  }
}
int sev[40][10];
int calc_seven() {
  sev[0][0] = 1;
  REP(i, 1, 34)
  REP(j, 0, 7) sev[i][j] = sev[i - 1][j] + sev[i - 1][j - 1] * C[cnt[i]][2];
  return sev[34][7];
}
const int one_nine[] = {1, 9, 10, 18, 19, 27, 28, 29, 30, 31, 32, 33, 34};
int calc_one_nine() {
  int ans = 0;
  REP(i, 0, 12) {
    int pri = 1;
    REP(j, 0, 12) {
      if (i == j)
        pri = pri * C[cnt[one_nine[j]]][2];
      else
        pri = pri * C[cnt[one_nine[j]]][1];
    }
    ans += pri;
  }
  return ans;
}
int b[150], c[150];
int dp[10][10][10];
bool check(int x) {
  if (x == 3) {
    REP(j, 1, 9) if (b[x * 9 + j] % 3) return 0;
    return 1;
  }
  REP(j, 1, 9) c[x * 9 + j] = b[x * 9 + j];
  REP(j, 1, 9) {
    if (c[x * 9 + j] < 0) return 0;
    c[x * 9 + j] %= 3;
    if (j > 7 && c[x * 9 + j]) return 0;
    c[x * 9 + j + 1] -= c[x * 9 + j];
    c[x * 9 + j + 2] -= c[x * 9 + j];
  }
  return 1;
}
void calc(int x, int s, int res) {
  if (s % 3 == 2) {
    bool findp = 0;
    REP(j, 1, 9) {
      if (b[x * 9 + j] >= 2) {
        b[x * 9 + j] -= 2;
        if (check(x)) dp[x][s / 3][1] += res, findp = 1;
        b[x * 9 + j] += 2;
        if (findp) break;
      }
    }
  } else if (check(x))
    dp[x][s / 3][0] += res;
}
void dfs(int x, int y, int s, int binom) {
  if (y > 9) {
    if (s % 3 != 1) calc(x, s, binom);
    return;
  }
  for (int k = 0; k + s <= 14 && k <= cnt[x * 9 + y]; k++) {
    b[x * 9 + y] = k;
    dfs(x, y + 1, s + k, binom * C[cnt[x * 9 + y]][k]);
  }
}
int calc_rong() {
  REP(i, 0, 3) dfs(i, 1, 0, 1);
  // REP(i, 0, 3) REP(j, 0, 4) REP(k, 0, 1) cerr << dp[i][j][k] << '\n';
  int ans = 0;
  REP(s1, 0, 4)
  REP(s2, 0, 4) REP(s3, 0, 4) REP(s4, 0, 4)                // 面子
      REP(i, 0, 1) REP(j, 0, 1) REP(k, 0, 1) REP(l, 0, 1)  // 带/不带雀头
      if (s1 + s2 + s3 + s4 == 4 && i + j + k + l == 1) ans +=
      dp[0][s1][i] * dp[1][s2][j] * dp[2][s3][k] * dp[3][s4][l];
  return ans;
}
int two_cup(int x, int y) {
  int ans = 0;
  REP(i, 0, 2) REP(j, 1, 7) REP(k, j + 3, 7) {
    if (x == i && (y >= j - 1 && y <= j + 2 || y >= k - 1 && y <= k + 2))
      continue;
    ans += C[cnt[x * 9 + y]][2] * C[cnt[i * 9 + j]][2] *
           C[cnt[i * 9 + j + 1]][2] * C[cnt[i * 9 + j + 2]][2] *
           C[cnt[i * 9 + k]][2] * C[cnt[i * 9 + k + 1]][2] *
           C[cnt[i * 9 + k + 2]][2];
  }
  // 同一花色，不能有重叠
  REP(i, 0, 2) REP(j, 1, 7) {
    if (x == i && (y >= j - 1 && y <= j + 2)) continue;
    REP(ii, i + 1, 2) REP(k, 1, 7) {
      if (x == ii && (y >= k - 1 && y <= k + 2)) continue;
      ans += C[cnt[x * 9 + y]][2] * C[cnt[i * 9 + j]][2] *
             C[cnt[i * 9 + j + 1]][2] * C[cnt[i * 9 + j + 2]][2] *
             C[cnt[ii * 9 + k]][2] * C[cnt[ii * 9 + k + 1]][2] *
             C[cnt[ii * 9 + k + 2]][2];
    }
  }
  return ans;
}
int calc_two_cup() {
  int ans = 0;
  REP(i, 0, 3) REP(j, 1, 9) if (cnt[i * 9 + j] >= 2) ans += two_cup(i, j);
  return ans;
}
void Solve() {
  cin >> n;
  // cerr << n << ' ' << C[n][14] << '\n';
  CLR(cnt), CLR(dp), CLR(sev);
  REP(i, 1, n) {
    string s;
    cin >> s;
    cnt[id[s]]++;
  }
  // cerr << calc_seven() + calc_one_nine() - calc_two_cup() + calc_rong() <<
  // '\n';
  int ans = calc_seven() + calc_one_nine() + calc_rong() - calc_two_cup();
  int gd = __gcd(ans, C[n][14]);
  cout << ans / gd << '/' << C[n][14] / gd << '\n';
}
signed main() {
  // freopen("z.in", "r", stdin);
  // freopen("z.out", "w", stdout);
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  int T = 1;
  init();
  cin >> T;
  while (T--) {
    Solve();
  }
  return 0;
}