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

const int MAXN = 10;
string arr[MAXN];

int n;

char get(int i, int j) {
    if (i < 0 || i >= n || j < 0 || j >= n) return '.';
    return arr[i][j];
}

int calc() {
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (arr[i][j] == 'M' || arr[i][j] == 'P' || arr[i][j] == 'O') {
                ++ans;
            }
            if (arr[i][j] == 'O') {
                for (int di = -1; di <= 0; ++di) {
                    for (int dj = -1; dj <= 1; ++dj) {
                        if (di == 0 && dj >= 0) continue;
                        int i1 = i + di;
                        int j1 = j + dj;
                        if (get(i1, j1) == 'O') ++ans;
                    }
                }
            }
            if (arr[i][j] == 'P') {
                for (int di = -1; di <= 1; ++di) {
                    for (int dj = -1; dj <= 1; ++dj) {
                        int i1 = i + di;
                        int j1 = j + dj;
                        if (get(i1, j1) == 'M') ++ans;
                    }
                }
            }
        }
    }
    return ans;
}

void solve_() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    cout << calc() << " ";
    deque<array<int, 2>> q;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (arr[i][j] == 'O' || arr[i][j] == 'M' || arr[i][j] == 'P') {
                q.push_back({i, j});
            }
        }
    }
    while (!q.empty()) {
        int i = q.front()[0];
        int j = q.front()[1];
        q.pop_front();
        char ch = arr[i][j];
        char goal;
        if (ch == 'O') goal = 'o';
        if (ch == 'M') goal = 'p';
        if (ch == 'P') goal = 'm';
        for (int di = -1; di <= 1; ++di) {
            for (int dj = -1; dj <= 1; ++dj) {
                int i1 = i + di;
                int j1 = j + dj;
                if (get(i1, j1) == goal) {
                    arr[i1][j1] = arr[i1][j1] - 'a' + 'A';
                    q.push_back({i1, j1});
                }
            }
        }
    }
    cout << calc() << "\n";
    for (int i = 0; i < n; ++i) {
        cout << arr[i] << "\n";
    }
}

/// #define MULTITEST

signed main() {
#ifdef LOCAL
    freopen("../input.txt", "r", stdin);
    freopen("../output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(0);
#endif
    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}