F. Corners
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Corners is one of the many games for two players on the chessboard. Initially, 12 white and black checkers are placed on the board as shown in the figure.

Players take turns moving pieces of their color (white starts the game). Each move consists either in moving one's checker to a free cell vertically or horizontally, or in performing a series of jumps. When jumping, the checker "flies" over the horizontally or vertically adjacent cell occupied by the checker (it does not matter, its own or the opponent's) and descends to the next cell in the same direction, which must be free. During the execution of a series of jumps, you can change the direction of the jumps, but you cannot go down twice on the same cell, as well as on the original cell.

The player who places his checkers on the opponent's starting position earlier than the other wins the game. The game ends in a draw if, after the white checkers have finished rebuilding, black can do the same in a single move.

Luckily, you don't have to write a program to implement this game! Instead, based on the analysis of the current position, determine the longest series of jumps that one of the checkers (of any color) can make. The length of a series is the number of jumps in it.

Input

The input contains eight lines of eight characters each. Each line corresponds to one line of the playing field (from top to bottom) and contains the symbols W, B or a dot, which corresponds to a white, black checker or an empty cell.

Output

The first line should contain the cell position from which the longest series of jumps can be made, in standard chess notation. The second line contains a single number — the number of jumps in such a series. If the problem admits several solutions, print the one for which the designation of the initial cell is minimal in the lexicographic order. If no jump can be made, the only line in the output file must contain the line Impossible.

Examples
Input
BBB.....
BBB.....
BBB.....
BBB.....
.....WWW
.....WWW
.....WWW
.....WWW
Output
a6
1
Input
B.B.B.B.
BB.B.B..
B.B.B.B.
...W....
........
..W.W.WW
WW.W.W..
..W.W.W.
Output
h3
7