It's election time. The farm is partitioned into a $5x5$ grid of cow locations, each of which holds either a Holstein ('$H$') or Jersey ('$J$') cow. The Jerseys want to create a voting district of 7 contiguous (vertically or horizontally) cow locations such that the Jerseys outnumber the Holsteins. How many ways can this be done for the supplied grid?

Input

• Lines $1..5$: Each of the five lines contains five characters per line, each '$H$' or '$J$'. No spaces are present.

Output

• Line 1: The number of distinct districts of 7 connected cows such that the Jerseys outnumber the Holsteins in the district.

Examples

Input 1

HHHHH
JHJHJ
HHHHH
HJHHJ
HHHHH

Output 1

2

Output Details

The two possible districts are:

.....                .....
JHJHJ                JHJHJ
....H       and      .H...
....J                .J...
.....                .....

Any other possible district with seven cows has fewer than 4 Jerseys.

Problem credits: Coaches, 2004