B'Alice and Bob are playing a game with strings. There will be t rounds in the game. In each round, there will be a string s consisting of lowercase English letters. Alice moves first and both the players take alternate turns. Alice is allowed to remove any substring of even length (possibly empty) and Bob is allowed to remove any substring of odd length from s . More formally, if there was a string s = s_1s_2 ldots s_k the player can choose a substring s_ls_{l+1} ldots s_{r-1}s_r with length of corresponding parity and remove it. After that the string will become s = s_1 ldots s_{l-1}s_{r+1} ldots s_k . After the string becomes empty, the round ends and each player calculates his/her score for this round. The score of a player is the sum of values of all characters removed by him/her. The value of texttt{a} is 1 , the value of texttt{b} is 2 , the value of texttt{c} is 3 , ldots , and the value of texttt{z} is 26 . The player with higher score wins the round. For each round, determine the winner and the difference between winner 's and loser 's scores. Assume that both players play optimally to maximize their score. It can be proved that a draw is impossible. The first line of input contains a single integer t ( 1 <= q t <= q 5 cdot 10^4 ) denoting the number of rounds. Each of the next t lines contain a single string s ( 1 <= q |s| <= q 2 cdot 10^5 ) consisting of lowercase English letters, denoting the string used for the round. Here |s| denotes the length of the string s . It is guaranteed that the sum of |s| over all rounds does not exceed 2 cdot 10^5 . For each round, print a single line containing a string and an integer. If Alice wins the round, the string must be "Alice". If Bob wins the round, the string must be "Bob". The integer must be the difference between their scores assuming both players play optimally. For '...