Peg Solution:

#include <bits/stdc++.h>
using namespace std;

int main(){
    // #ifndef TESTING
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif

    char grid[7][7] = {};
    cin >> grid[0][2] >> grid[0][3] >> grid[0][4];
    cin >> grid[1][2] >> grid[1][3] >> grid[1][4];
    cin >> grid[2][0] >> grid[2][1] >> grid[2][2] >> grid[2][3] >> grid[2][4] >> grid[2][5] >> grid[2][6];
    cin >> grid[3][0] >> grid[3][1] >> grid[3][2] >> grid[3][3] >> grid[3][4] >> grid[3][5] >> grid[3][6];
    cin >> grid[4][0] >> grid[4][1] >> grid[4][2] >> grid[4][3] >> grid[4][4] >> grid[4][5] >> grid[4][6];
    cin >> grid[5][2] >> grid[5][3] >> grid[5][4];
    cin >> grid[6][2] >> grid[6][3] >> grid[6][4];

    int count = 0;
    for(int i = 0; i < 7; i++){
        for(int j = 0; j < 7; j++){
            if(grid[i][j] == '.'){
                if(i > 1 && grid[i-1][j] == 'o' && grid[i-2][j] == 'o'){
                    count++;
                }
                if(i < 5 && grid[i+1][j] == 'o' && grid[i+2][j] == 'o'){
                    count++;
                }
                if(j > 1 && grid[i][j-1] == 'o' && grid[i][j-2] == 'o'){
                    count++;
                }
                if(j < 5 && grid[i][j+1] == 'o' && grid[i][j+2] == 'o'){
                    count++;
                }
            }
        }
        
    }
    cout << count << endl;

    return 0;
}