#include <string>
#include <vector>
#include <queue>
#define ABS(a) ((a) < 0 ? (a) * -1 : (a))

using namespace std;

const int dir[4][2] = { {0, 1}, {1, 0}, {-1, 0}, {0, -1} };

bool isok(vector<string> place, int row, int col) {
    // row, col 위치에서 맨해튼 거리 2 내에 P가 있는지 검사
    vector<vector<bool>> visit(place.size(), vector<bool>(place.size(), false));
    queue<pair<int, int>> q;
    q.push(make_pair(row, col));
    visit[row][col] = true;
    while(!q.empty()) {
        pair<int, int> top = q.front();
        q.pop();
        
        for(int i = 0 ; i < 4 ; i++) {
            int nextrow = top.first + dir[i][0];
            int nextcol = top.second + dir[i][1];
            
            if(nextrow < 0 || nextcol < 0 || nextrow >= place.size() || nextcol >= place.size() ||
                visit[nextrow][nextcol] == true || ABS(nextrow - row) + ABS(nextcol - col) > 2 ||
                place[nextrow][nextcol] == 'X')
                continue;
            
            if(place[nextrow][nextcol] == 'P') 
                return false;
            
            visit[nextrow][nextcol] = true;
            q.push(make_pair(nextrow, nextcol));
        }   
    }
    return true;
}

vector<int> solution(vector<vector<string>> places) {
    vector<int> answer;
    for(vector<string> place : places) {        
        bool ok = true;
        for(int i = 0 ; i < place.size(); i++) {
            for(int j = 0 ; j < place[i].size() ; j++) {
                if(place[i][j] == 'P') {
                    if(!isok(place, i, j)) {
                        ok = false;  
                        j = i = place.size();
                        break;
                    }
                }
            }
        }
        answer.push_back(ok ? 1 : 0);
    }
    return answer;
}