문제1795--Hopscotch

### 1795: Hopscotch

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 56  통과: 30
[제출] [채점기록] [묻고답하기]

#### 문제 설명

The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes.

They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited).

With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201).

Determine the count of the number of distinct integers that can be created in this manner.

#### 입력 설명

Line 1 : T of test case number.
Lines 2...T*5+1 : The grid, five integers per line

#### 출력 설명

Lines 1...N : The number of distinct integers that can be constructed

#### 입력 예시 Copy

1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 2 1
1 1 1 1 1

#### 출력 예시 Copy

15