A. Vlad and the Best of Fivetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladislav has a string of length 5, whose characters are each either \texttt{A} or \texttt{B}.Which letter appears most frequently: \texttt{A} or \texttt{B}?InputThe first line of the input contains an integer t (1 \leq t \leq 32) — the number of test cases.The only line of each test case contains a string of length 5 consisting of letters \texttt{A} and \texttt{B}.All t strings in a test are different (distinct).OutputFor each test case, output one letter (\texttt{A} or \texttt{B}) denoting the character that appears most frequently in the string.ExampleInput
8ABABBABABABBBABAAAAABBBBBBABAAAAAABBAAAAOutput
B
A
B
A
B
A
A
A

8ABABBABABABBBABAAAAABBBBBBABAAAAAABBAAAA
B A B A B A A A 
['implementation', '*800']