B. Knight's Revenge
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

It is commonly said that one warrior in the field is not a warrior at all. However, the legendary hero Evpatiy Kolovrat questioned the validity of this assertion and ventured into a vast $$$10 \times 10$$$ field to confront the enemy forces, riding his loyal white steed and wielding his trusty sling.

Evpatiy wishes to select an empty cell $$$(x,y)$$$ within the field and remain there, aiming to defeat as many adversaries as possible. His prowess with the sling allows him to target enemies located in cells that can be reached by a knight's move from $$$(x,y)$$$. The task is to determine the maximum number of enemies that Evpatiy can defeat from any given position.

Input

The input consists of a description of the field, containing 10 lines, each with 10 characters. Empty cells are represented by the character ".", while cells occupied by enemies are marked by the character "h''. It is guaranteed that there is at least one empty cell in the field.

Output

Output a single integer: the maximum number of enemies that Evpatiy can defeat from a strategically chosen position.

Examples
Input
.hhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
.hhhhhhhhh
.hhhhhhhhh
hhhhhhhhhh
hhhhhhhhh.
Output
4
Input
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhhhhhhhh
hhhh.hhhhh
hhhhhhhhhh
hhhhh.hhhh
hhhhhhhhhh
hhhhhhhhhh
Output
7