P6331 [COCI 2007/2008 #1] PEG

You are given a $7 \times 7$ matrix representing a peg solitaire board. On the board, the first two rows and the last two rows have their first two columns as blank spaces (if this is hard to understand, see the sample). In the remaining cells, `o` means there is a peg, and `.` means the cell is empty. For any peg, if there is an adjacent peg directly above, below, left, or right of it, and the cell on the other side in that direction is empty, then it can jump over the adjacent peg. The jumped-over peg is removed from the board. This is counted as one move. Find the maximum number of moves that can be made on this board.

Input a board.

Output the maximum number of moves.

#### Notes **This problem is translated from [COCI2007-2008](https://hsin.hr/coci/archive/2007_2008/) [CONTEST #1](https://hsin.hr/coci/archive/2007_2008/contest1_tasks.pdf) *T2 PEG*** Translated by ChatGPT 5