#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

const int N = 1000010, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc() {
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x) {
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
template<typename T>
void print(T x) {
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
int n, ini, ans, book[15][15], a[15][15];
char s[15][15], up[300];
int nex[8] = {0, 0, 1, -1, -1, -1, 1, 1}, ney[8] = {1, -1, 0, 0, -1, 1, -1, 1};
int in(int x, int y)    {return x > 0 && y > 0 && x <= n && y <= n && s[x][y] != '.';}
int chk(int x, int y)   {return s[x][y] == 'M' || s[x][y] == 'O' || s[x][y] == 'P';}
int check(char a, char b)   {return (a == 'M' && b == 'P') || (a == 'P' && b == 'M') || (a == 'O' && b == 'O');}
int calc(int i, int j) {
    int val = 1;
    for(int k = 0; k < 8; ++k) {
        int x = i + nex[k], y = j + ney[k];
        if(in(x, y) && check(up[s[i][j]], s[x][y])) ++val;
    }
    return val;
}
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> (s[i] + 1);
    up['m'] = 'M', up['o'] = 'O', up['p'] = 'P';
    int sum = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) {
            if(chk(i, j))   ++ini;
            for(int k = 0; k < 8; ++k) {
                int x = i + nex[k], y = j + ney[k];
                if(in(x, y) && check(s[i][j], s[x][y])) ++sum;
            }
            if(s[i][j] == 'm' || s[i][j] == 'o' || s[i][j] == 'p') {
                a[i][j] = calc(i, j);
            }
            else    book[i][j] = 1; 
        }
    ini += sum / 2, ans = ini;
    while(1) {
        int x = 0, y = 0, mx = 0;
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j) if(!book[i][j] && a[i][j] > mx)    x = i, y = j, mx = a[i][j];
        if(mx < 2)  break;
        book[x][y] = 1, ans += a[x][y], a[x][y] = 0, s[x][y] = up[s[x][y]];
        for(int k = 0; k < 8; ++k) {
            int nx = x + nex[k], ny = y + ney[k];
            if(in(nx, ny) && !book[nx][ny]) a[nx][ny] = calc(nx, ny);
        }
    }
    cout << ini << " " << ans << "\n";
    for(int i = 1; i <= n; ++i, cout << "\n")
        for(int j = 1; j <= n; ++j) cout << s[i][j];
    return 0;
}