#include<bits/stdc++.h>

typedef int integer;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define EPS 1e-10
#define SIZE(x) (int) x.size()
#define INF 1000000000000LL
#define mod 1000000007
using namespace std;

vector<string> a;
vector<string> am;
vector<string> r;
vector<string> rm;

bool comp(string& a, string& b){
    string c = a, d = b;
    for (int i = 0; i < c.length(); i++){
        c[a.length() - 1 - i] = a[i];
    }
    for (int i = 0; i < b.length(); i++){
        d[b.length() - 1 - i] = b[i];
    }
    return c < d;
}

integer solve(integer index, bool m){
    if (!m && index == a.size()) return 0;
    if (m && index == am.size()) return 0;
    integer ans = solve(index + 1, m);
    if (!m){
        auto k = lower_bound(am.begin(), am.end(), a[index]);
        if (k != am.end()){
            string temp = a[index];
            reverse(temp.begin(), temp.end());
            k = lower_bound(rm.begin() + (k - am.begin()), rm.end(), temp, comp);
            if (k != rm.end()){
                temp = *k;
                reverse(temp.begin(), temp.end());
                k = lower_bound(am.begin(), am.end(), temp);
                ans = max(ans, 1 + solve(k - am.end(), !m));
            }
        }
    } else {
        auto k = lower_bound(a.begin(), a.end(), am[index]);
        if (k != a.end()){
            string temp = am[index];
            reverse(temp.begin(), temp.end());
            k = lower_bound(r.begin() + (k - a.begin()), r.end(), temp, comp);
            if (k != r.end()){
                temp = *k;
                reverse(temp.begin(), temp.end());
                k = lower_bound(a.begin(), a.end(), temp);
                ans = max(ans, 1 + solve(k - a.end(), !m));
            }
        }
    }
    return ans;
}

integer main() {
    ios_base::sync_with_stdio(false);

    int t;
    cin >> t;
    while (t--){
        int n;
        cin >> n;
        for (int i = 0; i < n; i++){
            string s;
            cin >> s;
            string rs = s;
            bool m = false;
            for (int j = 0; j < s.length(); j++){
                if (s[j] == 'm'){
                    m = true;
                }
                rs[s.length() - 1 - j] = s[j];
            }
            if (m){
                am.pb(s);
                rm.pb(rs);
            } else {
                a.pb(s);
                r.pb(rs);
            }
        }
        sort(a.begin(), a.end());
        sort(am.begin(), am.end());
        sort(r.begin(), r.end(), comp);
        sort(rm.begin(), rm.end(), comp);

        cout << solve(0, 0) << endl;
        cout << solve(0, 1) << endl;


//        for (int i = 0; i < r.size(); i++){
//            cout << r[i] << ' ';
//        }
    }

}