#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
}
char s[100][100];
int main(){
    int n; read(n);
    vector<int> dx = {0, 0, 1, 1, 1, -1, -1, -1};
    vector<int> dy = {1, -1, 0, -1, 1, 0, -1, 1};
    for(int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
    
    auto count_point = [&]() -> int {
        int res = 0, cnt = 0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++) if(isupper(s[i][j])){
                cnt++;
                for(int k = 0; k < 8; k++){
                    int ni = i + dx[k], nj = j + dy[k];
                    if(ni < 1 || ni > n || nj < 1 || nj > n) continue;
                    if(s[i][j] == s[ni][nj] && s[i][j] == 'O') res++;
                    if(s[i][j] == 'P' && s[ni][nj] == 'M') res++;
                    if(s[i][j] == 'M' && s[ni][nj] == 'P') res++;
                }
            }
        assert(res % 2 == 0);
        return res / 2 + cnt;
    };

    int point_start = count_point();

    queue<pair<int, int> > q;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++) if(isupper(s[i][j])) q.push({i, j});
    
    while(!q.empty()){
        auto [x, y] = q.front(); q.pop();
        for(int k = 0; k < 8; k++){
            int nx = x + dx[k], ny = y + dy[k];
            if(x < 1 || x > n || y < 1 || y > n) continue;
            if(!islower(s[nx][ny])) continue;
            if(s[nx][ny] - 'a' == s[x][y] - 'A'){
                if(s[x][y] == 'O'){
                    s[nx][ny] = s[x][y];
                    q.push({nx, ny});
                }
            }
            else{
                if(s[x][y] == 'O' || s[nx][ny] == 'o') continue;
                s[nx][ny] = s[nx][ny] - 'a' + 'A';
                q.push({nx, ny});
            }
        }
    }

    int point_end = count_point();
    printf("%d %d\n", point_start, point_end);
    for(int i = 1; i <= n; i++) puts(s[i] + 1);
    return 0;
}