#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

struct a
{
    int pt = 0;
    int i;
    int j;
};
typedef struct a a;

struct comp
{
    bool operator()(a const &b, a const &c)
    {
        return b.pt < c.pt;
    }
};

vector<int> x = {0, 1, -1, 0, 1, 1, -1, -1};
vector<int> y = {1, 0, 0, -1, 1, -1, 1, -1};
int n;
vector<string> v(100);
vector<vector<int>> v2(100, vector<int>(100));
priority_queue<a, vector<a>, comp> pq;

int f(int i, int j, char m)
{

    int c = 0;
    for (int k = 0; k < 8; k++)
    {
        if (i + x[k] >= 0 && i + x[k] < n && j + y[k] >= 0 && j + y[k] < n && v[i + x[k]][j + y[k]] == m)
        {
            c++;
        }
    }

    return c;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int pti = 0, pt = 0, p = 0;
    cin >> n;

    for (int i = 0; i < n; i++)
    {

        cin >> v[i];
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            v2[i][j] = 0;
            if (v[i][j] == 'p')
            {
                v2[i][j] += f(i, j, 'M');
            }
            else if (v[i][j] == 'm')
            {
                v2[i][j] += f(i, j, 'P');
            }
            else if (v[i][j] == 'o')
            {
                v2[i][j] += f(i, j, 'O');
            }
            else if (v[i][j] == 'P')
            {
                pti += f(i, j, 'M');
                p++;
            }
            else if (v[i][j] == 'M')
            {
                pti += f(i, j, 'P');
                p++;
            }
            else if (v[i][j] == 'O')
            {
                pti += f(i, j, 'O');
                p++;
            }
            // cout << pti << " " << p << endl;

            a b;
            b.pt = v2[i][j];
            b.i = i;
            b.j = j;
            pq.push(b);
        }
    }
    pti = (pti / 2) + p;

    for (int l = 0; l < n * n; l++)
    {
        int i = pq.top().i;
        int j = pq.top().j;

        /* cout << i << " " << j << " " << v2[i][j] << "\n"; */
        pq.pop();
        if (v2[i][j] > 0)
        {
            if (v[i][j] == 'p')
            {
                v[i][j] = 'P';
                pt += v2[i][j] + 1;
                for (int k = 0; k < 8; k++)
                {
                    if (i + x[k] >= 0 && i + x[k] < n && j + y[k] >= 0 && j + y[k] < n && v[i + x[k]][j + y[k]] == 'm')
                    {
                        v2[i + x[k]][j + y[k]]++;
                        a b;
                        b.pt = v2[i + x[k]][j + y[k]];
                        b.i = i + x[k];
                        b.j = j + y[k];
                        pq.push(b);
                    }
                }
            }
            if (v[i][j] == 'm')
            {
                v[i][j] = 'M';
                pt += v2[i][j] + 1;
                for (int k = 0; k < 8; k++)
                {
                    if (i + x[k] >= 0 && i + x[k] < n && j + y[k] >= 0 && j + y[k] < n && v[i + x[k]][j + y[k]] == 'p')
                    {
                        v2[i + x[k]][j + y[k]]++;
                        a b;
                        b.pt = v2[i + x[k]][j + y[k]];
                        b.i = i + x[k];
                        b.j = j + y[k];
                        pq.push(b);
                    }
                }
            }
            if (v[i][j] == 'o')
            {
                v[i][j] = 'O';
                pt += v2[i][j] + 1;
                for (int k = 0; k < 8; k++)
                {
                    if (i + x[k] >= 0 && i + x[k] < n && j + y[k] >= 0 && j + y[k] < n && v[i + x[k]][j + y[k]] == 'o')
                    {
                        v2[i + x[k]][j + y[k]]++;
                        a b;
                        b.pt = v2[i + x[k]][j + y[k]];
                        b.i = i + x[k];
                        b.j = j + y[k];
                        pq.push(b);
                    }
                }
            }
        }
        else
        {
            break;
        }
    }

    cout << pti << " " << pt + pti << endl;

    for (int i = 0; i < n; i++)
    {
        cout << v[i] << "\n";
    }

    /*  for (int i = 0; i < n; i++)
     {
         for (int j = 0; j < n; j++)
         {
             cout << v2[i][j];
         }
         cout << "\n";
     } */

    return 0;
}