# Coming Soon

.

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 nn words consisting of the first 55 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 55 times, all other letters occur 44 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 nn 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 00.

Input

The first line contains one integer tt (1t50001≤t≤5000) — the number of test cases. Then tt test cases follow.

The first line of each test case contains one integer nn (1n21051≤n≤2⋅105) — the number of the words in the sequence. Then nn 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 nn over all test cases doesn’t exceed 21052⋅105; the sum of the lengths of all words over all test cases doesn’t exceed 41054⋅105.

Output Interesting Story solution codeforces

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.

input Interesting Story solution codeforces

Copy Interesting Story solution codeforces
6
3
bac
e
3
aba
abcde
aba
2
baba
baba
4
ab
ab
c
bc
5
cbdca
d
a
d
e
3
b
c
ca


output

Copy
3
2
0
2
3
2

Note

In the first test case of the example, all 33 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 11-st and the 33-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 00.

In the fourth test case of the example, Stephen can use the 33-rd and the 44-th words to make an interesting story. The interesting story is “c ca“.

For Solution