Problem9309--ABC296 —— B - Chessboard

9309: ABC296 —— B - Chessboard

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

We have a grid with $8$ rows and $8$ columns of squares. Each of the squares has a $2$-character name determined as follows.

-   The first character of the name of a square in the $1$-st column from the left is `a`. Similarly, the first character of the name of a square in the $2$-nd, $3$-rd, $\ldots$, $8$-th column from the left is `b`, `c`, `d`, `e`, `f`, `g`, `h`, respectively.
-   The second character of the name of a square in the $1$-st row from the bottom is `1`. Similarly, the second character of the name of a square in the $2$-nd, $3$-rd, $\ldots$, $8$-th row from the bottom is `2`, `3`, `4`, `5`, `6`, `7`, `8`, respectively.

For instance, the bottom-left square is named `a1`, the bottom-right square is named `h1`, and the top-right square is named `h8`.

You are given $8$ strings $S_1,\ldots,S_8$, each of length $8$, representing the state of the grid.  
The $j$-th character of $S_i$ is `*` if the square at the $i$-th row from the top and $j$-th column from the left has a piece on it, and `.` otherwise. The character `*` occurs exactly once among $S_1,\ldots,S_8$. Find the name of the square that has a piece on it.

Input

The input is given from Standard Input in the following format:

```
$S_1$
$S_2$
$S_3$
$S_4$
$S_5$
$S_6$
$S_7$
$S_8$
```

Output

Print the answer.

Constraints

-   $S_i$ is a string of length $8$ consisting of `.` and`*`.
-   The character `*` occurs exactly once among $S_1,\ldots,S_8$.

Sample 1 Input

........
........
........
........
........
........
........
*.......

Sample 1 Output

a1
As explained in the problem statement, the bottom-left square is named a1.

Sample 2 Input

........
........
........
........
........
.*......
........
........

Sample 2 Output

b3

Source/Category