Problem description.
Tic-tac-toe is the third most popular activity to kill a lazy afternoon in Ardenia.Arthum and Breece are not fans of this game, but their mother told them to play, so they sit at a 5 x 5 board. Both have a large pile of marbles: marbles of Arthum have an A written on them and that of Breece have a B. However, as they are both two years old, they have no concept of rounds. Instead, they just toss their marbles as quick as possible, so after a while each board field has either marble A or marble B.
At that point, they would like to determine the winner, but counting is not their strong point, either. (They are two years old, remember?) Recall that the goal of tic-tac-toe is to have three own marbles in a row, i.e., lying at three consecutive fields horizontally, vertically or diagonally. If both Arthum and Breece have their three marbles in a row, or neither of them has it, we call it a draw. 

Input

The input contains several test cases. The first line of the input contains a positive integer Z , denoting the number of test cases.
Then Z input instances follow, each conforming to the following format:
The input instance describes marbles placed on the board in a single game. The instance consists of 5 rows and each of them consists of 5 letters: A or B .

Output

You should output one line describing the outcome of the game, i.e., one of the three possible strings: A wins, B wins, or draw .

Constraints

Z ≤ 10^5

Example
Input:
2
AABBA
BAAAB
AAABA
ABAAB
BAAAB
AAAAA
AAAAA
BAAAA
ABAAA
AABAA

Output:
A wins
draw

见题面

见题面