Contest Duration: - (local time) (100 minutes) Back to Home
C - Counting Squares /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

この平面上の正方形であって、4 頂点全てにポーンが置いてあるものの個数を求めてください。

### 制約

• S_1,\ldots,S_9 はそれぞれ #. からなる長さ 9 の文字列

### 入力

S_1
S_2
\vdots
S_9


### 入力例 1

##.......
##.......
.........
.......#.
.....#...
........#
......#..
.........
.........


### 出力例 1

2


よって答えは 2 です。

### 入力例 2

.#.......
#.#......
.#.......
.........
....#.#.#
.........
....#.#.#
........#
.........


### 出力例 2

3


Score : 300 points

### Problem Statement

There is a two-dimensional plane. For integers r and c between 1 and 9, there is a pawn at the coordinates (r,c) if the c-th character of S_{r} is #, and nothing if the c-th character of S_{r} is ..

Find the number of squares in this plane with pawns placed at all four vertices.

### Constraints

• Each of S_1,\ldots,S_9 is a string of length 9 consisting of # and ..

### Input

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

S_1
S_2
\vdots
S_9


### Sample Input 1

##.......
##.......
.........
.......#.
.....#...
........#
......#..
.........
.........


### Sample Output 1

2


The square with vertices (1,1), (1,2), (2,2), and (2,1) have pawns placed at all four vertices.

The square with vertices (4,8), (5,6), (7,7), and (6,9) also have pawns placed at all four vertices.

### Sample Input 2

.#.......
#.#......
.#.......
.........
....#.#.#
.........
....#.#.#
........#
.........


### Sample Output 2

3