B'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 . 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 cdot 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. xe2 x80 x89e. 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 cdot 10^5 ; the sum of the lengths of all words over all test cases doesn 't exceed 4 cdot 10^5 . 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. In the first test case of the e'...