description: Stephen Queen wants to write a story. He is a very unusual writer, he uses only letters 'a', 'b', 'c', 'd' and 'e'!
  
  To compose a story, Stephen wrote out n words consisting of the first 5 lowercase letters of the Latin alphabet. He wants to select the maximum number of words to make an interesting story.
  
  Let a story be a sequence of words that are not necessarily different. A story is called interesting if there exists a letter which occurs among all words of the story more times than all other letters together.
  
  For example, the story consisting of three words "bac", "aaada", "e" is interesting (the letter 'a' occurs 5 times, all other letters occur 4 times in total). But the story consisting of two words "aba", "abcde" is not (no such letter that it occurs more than all other letters in total).
  
  You are given a sequence of n words consisting of letters 'a', 'b', 'c', 'd' and 'e'. Your task is to choose the maximum number of them to make an interesting story. If there's no way to make a non-empty story, output 0.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 5000) — the number of test cases. Then t test cases follow.
  
  The first line of each test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of the words in the sequence. Then n lines follow, each of them contains a word — a non-empty string consisting of lowercase letters of the Latin alphabet. The words in the sequence may be non-distinct (i. e. duplicates are allowed). Only the letters 'a', 'b', 'c', 'd' and 'e' may occur in the words.
  
  It is guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^5; the sum of the lengths of all words over all test cases doesn't exceed 4 ⋅ 10^5.
  
  Output
  
  For each test case, output the maximum number of words that compose an interesting story. Print 0 if there's no way to make a non-empty interesting story.
  
  Example
  
  Input
  
  
  6
  3
  bac
  aaada
  e
  3
  aba
  abcde
  aba
  2
  baba
  baba
  4
  ab
  ab
  c
  bc
  5
  cbdca
  d
  a
  d
  e
  3
  b
  c
  ca
  
  
  Output
  
  
  3
  2
  0
  2
  3
  2
  
  Note
  
  In the first test case of the example, all 3 words can be used to make an interesting story. The interesting story is "bac aaada e".
  
  In the second test case of the example, the 1-st and the 3-rd words can be used to make an interesting story. The interesting story is "aba aba". Stephen can't use all three words at the same time.
  
  In the third test case of the example, Stephen can't make a non-empty interesting story. So the answer is 0.
  
  In the fourth test case of the example, Stephen can use the 3-rd and the 4-th words to make an interesting story. The interesting story is "c bc".
solution: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  
  
  public class Main implements Runnable {
      int n, m, k;
      static boolean use_n_tests = true;
      long mod = 1_000_000_007;
      Random rand = new Random();
      Boolean[][] dp;
  
      void solve(FastScanner in, PrintWriter out, int testNumber) {
          n = in.nextInt();
          List<int[]> ls = new ArrayList<>();
          int[] total = new int[n];
          for (int i = 0; i < n; i++) {
              char[] c = in.nextc();
              int[] cnt = new int[5];
              for (int i1 = 0; i1 < c.length; i1++) {
                  cnt[c[i1] - 'a']++;
              }
              total[i] = c.length;
              ls.add(cnt);
          }
          int result = 0;
          for (int i = 0; i < 5; i++) {
              List<Freq> tmp = new ArrayList<>();
              for (int j = 0; j < ls.size(); j++) {
                  tmp.add(new Freq(ls.get(j)[i], total[j] - ls.get(j)[i]));
              }
              Collections.sort(tmp, Comparator.comparing(Freq::getHowMany));
              int ans = 0;
              int cur = tmp.get(0).howMany;
              int other = tmp.get(0).another;
              if (cur > other) {
                  ans++;
                  for (int k = 1; k < tmp.size(); k++) {
                      int newCur = cur + tmp.get(k).howMany;
                      int newOther = other + tmp.get(k).another;
                      if (newCur <= newOther) {
                          break;
                      }
                      cur = newCur;
                      other = newOther;
                      ans++;
                  }
              }
              result = Math.max(ans, result);
          }
          out.println(result);
  
      }
  
      class Freq {
          Freq(int h, int a) {
              howMany = h;
              another = a;
          }
          int howMany;
          int another;
          int getHowMany() {
              return -(howMany - another);
          }
      }
  
      // ****************************** template code ***********
  
      class Pt {
          int x, y;
  
          boolean sameAxis(Pt b) {
              return b.x == x || b.y == y;
          }
  
          int manxDist(Pt b) {
              return Math.abs(x - b.x) + Math.abs(y - b.y);
          }
  
          void read() {
              x = in.nextInt();
              y = in.nextInt();
          }
      }
  
      void swap(Integer[] a, int i, int j) {
          Integer tmp = a[i];
          a[i] = a[j];
          a[j] = tmp;
      }
  
      void swap(List<Integer> a, int i, int j) {
          Integer tmp = a.get(i);
          a.set(i, a.get(j));
          a.set(j, tmp);
      }
  
      long manhDist(long x, long y, long x1, long y1) {
          return Math.abs(x - x1) + Math.abs(y - y1);
      }
  
      double dist(double x, double y, double x1, double y1) {
          return Math.sqrt(Math.pow(x - x1, 2.0) + Math.pow(y - y1, 2.0));
      }
  
      public static class FW {
          public static void add(long[] t, int i, long value) {
              for (; i < t.length; i |= i + 1)
                  t[i] += value;
          }
  
          public static long sum(long[] t, int i) {
              long res = 0;
              for (; i >= 0; i = (i & (i + 1)) - 1)
                  res += t[i];
              return res;
          }
  
          public static void add(long[] t, int a, int b, long value) {
              add(t, a, value);
              add(t, b + 1, -value);
          }
      }
  
      int sign(int a) {
          if (a < 0) {
              return -1;
          }
          return 1;
      }
  
      long binpow(long a, int b) {
          long res = 1;
          while (b != 0) {
              if (b % 2 == 0) {
                  b /= 2;
                  a *= a;
                  a %= mod;
              }
  
              b--;
              res *= a;
              res %= mod;
          }
          return res;
      }
  
      List<Integer> getGidits(long n) {
          List<Integer> res = new ArrayList<>();
          while (n != 0) {
              res.add((int) (n % 10L));
              n /= 10;
          }
          return res;
      }
  
      List<Integer> generatePrimes(int n) {
          List<Integer> res = new ArrayList<>();
          boolean[] sieve = new boolean[n + 1];
          for (int i = 2; i <= n; i++) {
              if (!sieve[i]) {
                  res.add(i);
              }
              if ((long) i * i <= n) {
                  for (int j = i * i; j <= n; j += i) {
                      sieve[j] = true;
                  }
              }
          }
          return res;
      }
  
      int[] ask(int l) {
          System.out.printf("? %d\n", l);
          System.out.flush();
          return in.nextArray(n);
      }
  
      static int stack_size = 1 << 29;
  
      static class Coeff {
          long mod;
          long[][] C;
          long[] fact;
          boolean cycleWay = false;
  
          Coeff(int n, long mod) {
              this.mod = mod;
              fact = new long[n + 1];
              fact[0] = 1;
              for (int i = 1; i <= n; i++) {
                  fact[i] = i;
                  fact[i] %= mod;
                  fact[i] *= fact[i - 1];
                  fact[i] %= mod;
              }
          }
  
          Coeff(int n, int m, long mod) {
              // n > m
              cycleWay = true;
              this.mod = mod;
              C = new long[n + 1][m + 1];
              for (int i = 0; i <= n; i++) {
                  for (int j = 0; j <= Math.min(i, m); j++) {
                      if (j == 0 || j == i) {
                          C[i][j] = 1;
                      } else {
                          C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
                          C[i][j] %= mod;
                      }
                  }
              }
          }
  
          public long C(int n, int m) {
              if (cycleWay) {
                  return C[n][m];
              }
              return fC(n, m);
          }
  
          private long fC(int n, int m) {
              return (fact[n] * inv(fact[n - m] * fact[m] % mod)) % mod;
          }
  
          private long inv(long r) {
              if (r == 1)
                  return 1;
              return ((mod - mod / r) * inv(mod % r)) % mod;
          }
      }
  
      class Pair {
          int first;
          long second;
  
          Pair(int f, long s) {
              first = f;
              second = s;
          }
  
          public int getFirst() {
              return first;
          }
  
          public long getSecond() {
              return second;
          }
      }
  
      class MultisetTree<T> {
          int size = 0;
  
          TreeMap<T, Integer> mp = new TreeMap<>();
  
          void add(T x) {
              mp.merge(x, 1, Integer::sum);
              size++;
          }
  
          void remove(T x) {
              if (mp.containsKey(x)) {
                  mp.merge(x, -1, Integer::sum);
                  if (mp.get(x) == 0) {
                      mp.remove(x);
                  }
                  size--;
              }
          }
  
          boolean contains(T x) {
              return mp.containsKey(x);
          }
  
          T greatest() {
              return mp.lastKey();
          }
  
          T higher(T x) {
              return mp.higherKey(x);
          }
  
          T smallest() {
              return mp.firstKey();
          }
  
          int size() {
              return size;
          }
  
          int diffSize() {
              return mp.size();
          }
      }
  
      class Multiset<T> {
          int size = 0;
  
          Map<T, Integer> mp = new HashMap<>();
  
          void add(T x) {
              mp.merge(x, 1, Integer::sum);
              size++;
          }
  
          boolean contains(T x) {
              return mp.containsKey(x);
          }
  
          void remove(T x) {
              if (mp.containsKey(x)) {
                  mp.merge(x, -1, Integer::sum);
                  if (mp.get(x) == 0) {
                      mp.remove(x);
                  }
                  size--;
              }
          }
  
          int size() {
              return size;
          }
  
          int diffSize() {
              return mp.size();
          }
      }
  
      static class Range {
          int l, r;
          int id;
  
          public int getL() {
              return l;
          }
  
          public int getR() {
              return r;
          }
  
          public Range(int l, int r, int id) {
              this.l = l;
              this.r = r;
              this.id = id;
          }
      }
  
      static class Array {
          static Range[] readRanges(int n, FastScanner in) {
              Range[] result = new Range[n];
              for (int i = 0; i < n; i++) {
                  result[i] = new Range(in.nextInt(), in.nextInt(), i);
              }
              return result;
          }
  
          static List<List<Integer>> intInit2D(int n) {
              List<List<Integer>> res = new ArrayList<>();
              for (int i = 0; i < n; i++) {
                  res.add(new ArrayList<>());
              }
              return res;
          }
  
          static boolean isSorted(Integer[] a) {
              for (int i = 0; i < a.length - 1; i++) {
                  if (a[i] > a[i + 1]) {
                      return false;
                  }
              }
              return true;
          }
  
          static public long sum(int[] a) {
              long sum = 0;
              for (int x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public long sum(long[] a) {
              long sum = 0;
              for (long x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public long sum(Integer[] a) {
              long sum = 0;
              for (int x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public int min(Integer[] a) {
              int mn = Integer.MAX_VALUE;
              for (int x : a) {
                  mn = Math.min(mn, x);
              }
              return mn;
          }
  
          static public int min(int[] a) {
              int mn = Integer.MAX_VALUE;
              for (int x : a) {
                  mn = Math.min(mn, x);
              }
              return mn;
          }
  
          static public int max(Integer[] a) {
              int mx = Integer.MIN_VALUE;
              for (int x : a) {
                  mx = Math.max(mx, x);
              }
              return mx;
          }
  
          static public int max(int[] a) {
              int mx = Integer.MIN_VALUE;
              for (int x : a) {
                  mx = Math.max(mx, x);
              }
              return mx;
          }
  
          static public int[] readint(int n, FastScanner in) {
              int[] out = new int[n];
              for (int i = 0; i < out.length; i++) {
                  out[i] = in.nextInt();
              }
              return out;
          }
      }
  
      class Graph {
          List<List<Integer>> graph;
  
          Graph(int n) {
              create(n);
          }
  
          private void create(int n) {
              List<List<Integer>> graph = new ArrayList<>();
              for (int i = 0; i < n; i++) {
                  graph.add(new ArrayList<>());
              }
              this.graph = graph;
          }
  
          void read(int m, FastScanner in) {
              for (int i = 0; i < m; i++) {
                  int v = in.nextInt() - 1;
                  int u = in.nextInt() - 1;
                  graph.get(v).add(u);
              }
          }
  
          void readBi(int m, FastScanner in) {
              for (int i = 0; i < m; i++) {
                  int v = in.nextInt() - 1;
                  int u = in.nextInt() - 1;
                  graph.get(v).add(u);
                  graph.get(u).add(v);
              }
          }
      }
  
      class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner(InputStream io) {
              br = new BufferedReader(new InputStreamReader(io));
          }
  
          public String line() {
              String result = "";
              try {
                  result = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return result;
          }
  
          public String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          public char[] nextc() {
              return next().toCharArray();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public int[] nextArray(int n) {
              int[] res = new int[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextInt();
              }
              return res;
          }
  
          public long[] nextArrayL(int n) {
              long[] res = new long[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextLong();
              }
              return res;
          }
  
          public Long[] nextArrayL2(int n) {
              Long[] res = new Long[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextLong();
              }
              return res;
          }
  
  
          public Integer[] nextArray2(int n) {
              Integer[] res = new Integer[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextInt();
              }
              return res;
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
      }
  
      void run_t_tests() {
          int t = in.nextInt();
          int i = 0;
          while (t-- > 0) {
              solve(in, out, i++);
          }
      }
  
      void run_one() {
          solve(in, out, -1);
      }
  
      @Override
      public void run() {
          in = new FastScanner(System.in);
          out = new PrintWriter(System.out);
          if (use_n_tests) {
              run_t_tests();
          } else {
              run_one();
          }
          out.close();
      }
  
      static FastScanner in;
      static PrintWriter out;
  
      public static void main(String[] args) throws InterruptedException {
          Thread thread = new Thread(null, new Main(), "", stack_size);
          thread.start();
          thread.join();
      }
  }