E

#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#define ll long long

using namespace std;



int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll t; cin >> t;
  while (t--) {
    int n; cin >> n;
    vector<vector<int>> a(26);
    for (int i = 0; i < n; ++i) {
      string s; cin >> s;
      ll ia = -s.size();
      for (int j = 0; j < 26; ++j) {
        a[j].push_back(ia);
      }
      for (int i = 0; i < s.size(); ++i) {
        a[s[i] - 'a'][a[s[i] - 'a'].size() - 1] += 2;
      }
    }
    ll anscnt = 0;
    ll anslet = 0;
    for (int i = 0; i < 26; ++i) {
      vector<int> b = a[i];
      sort(b.rbegin(), b.rend());
      if (b[0] <= 0) continue;
      ll sum = b[0];
      ll j = 1;
      for (; j < n && sum > 0; ++j) {
        sum += b[j];
      }
      if (sum <= 0) --j;
      if (j > anscnt) {
        anscnt = j;
        anslet = i;
      }
    }
    cout << anscnt << "\n";
  }
}