Rigging the Bovine Election   cowrig.X

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?

PROBLEM NAME: cowrig.X

INPUT FORMAT:

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

SAMPLE INPUT:

HHHHH
JHJHJ
HHHHH
HJHHJ
HHHHH

OUTPUT FORMAT:

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

SAMPLE OUTPUT:

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.