#include<bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
using vii = vector<ii>;

#define rep(i, a, b) for (int i = a; i < b; i++)

vii dirs = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    vector<vector<char>> grid(n, vector<char>(n));
    rep(i, 0, n)
    rep(j, 0, n)
        cin >> grid[i][j];

    int start = 0, end = 0, ex = 0;
    rep(i, 0, n)
    rep(j, 0, n) {
        if (isupper(grid[i][j])) {
            start++;
            for (auto [x, y] : dirs) {
                if (i + x >= 0 && i + x < n && j + y >= 0 && j + y < n) {
                    ex += (grid[i][j] == 'P' && grid[i + x][j + y] == 'M') ||
                             (grid[i][j] == 'M' && grid[i + x][j + y] == 'P') ||
                             (grid[i][j] == 'O' && grid[i + x][j + y] == 'O');

                } 
            }
        }
    }

    start += ex / 2;

    end = start;
    int bestMove = 0, r, c;

    do {

        if (bestMove) {
            grid[r][c] = toupper(grid[r][c]);
            end += bestMove;
            bestMove = r = c = 0;
        }

        rep(i, 0, n)
        rep(j, 0, n) {
            if (islower(grid[i][j])) {
                int cur = 1;
                for (auto [x, y] : dirs) {
                    if (i + x >= 0 && i + x < n && j + y >= 0 && j + y < n) {
                        cur += (grid[i][j] == 'p' && grid[i + x][j + y] == 'M') ||
                                 (grid[i][j] == 'm' && grid[i + x][j + y] == 'P') ||
                                 (grid[i][j] == 'o' && grid[i + x][j + y] == 'O');
                    } 
                }

                if (cur > bestMove)
                    bestMove = cur, r = i, c = j;
            }
        }

    }while (bestMove > 1);

    cout << start << " " << end << "\n";
    rep(i, 0, n) {
        rep(j, 0, n) {
            cout << grid[i][j];
        }

        cout << "\n";
    }
}