100 atcoder#ABC296B. [ABC296B] Chessboard
[ABC296B] Chessboard
Score : points
Problem Statement
Locate a piece on a chessboard.
We have a grid with rows and columns of squares. Each of the squares has a -character name determined as follows.
- The first character of the name of a square in the -st column from the left is
a. Similarly, the first character of the name of a square in the -nd, -rd, , -th column from the left isb,c,d,e,f,g,h, respectively. - The second character of the name of a square in the -st row from the bottom is
1. Similarly, the second character of the name of a square in the -nd, -rd, , -th row from the bottom is2,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 strings , each of length , representing the state of the grid.
The -th character of is * if the square at the -th row from the top and -th column from the left has a piece on it, and . otherwise.
The character * occurs exactly once among .
Find the name of the square that has a piece on it.
Constraints
- is a string of length consisting of
.and*. - The character
*occurs exactly once among .
Input
The input is given from Standard Input in the following format:
Output
Print the answer.
........
........
........
........
........
........
........
*.......
a1
As explained in the problem statement, the bottom-left square is named a1.
........
........
........
........
........
.*......
........
........
b3