C.cpp

#include <bits/stdc++.h>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef QUYNX_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

int main() {
    ios_base::sync_with_stdio(false);
#ifndef QUYNX_DEBUG 
    cin.tie(nullptr);
#endif
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
        vector<vector<int>> letterCountMinusOthers(5);
        for (int i = 0; i < n; i++) {
            string s;
            cin >> s;
            int l = s.length();
            array<int,5> cnt{};
            for (auto& c: s) {
                ++cnt[c-'a'];
            }
            for (int j = 0; j < 5; ++j) {
                letterCountMinusOthers[j].push_back(cnt[j] * 2 - l);
            }
        }
        int ans = 0;
        for (int i = 0; i < 5; ++i) {
            sort(letterCountMinusOthers[i].rbegin(), letterCountMinusOthers[i].rend());
            int cur = 0, cnt = 0;
            for (auto& num: letterCountMinusOthers[i]) {
                if (num + cur > 0) cur += num, ++cnt;
                else break;
            }
            ans = max(ans, cnt);
        }
        cout << ans << "\n";
    }
}