#include <bits/stdc++.h>

using namespace std;
#define int long long
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*1LL*u)%p;} else {int u=po(a,b-1);return (a*1LL*u)%p;}}
int inv(int x) {return po(x,p-2);}
mt19937 rnd;
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#define debugv(v) do {cout<< #v <<" : {"; for(int izxc=0;izxc<v.size();++izxc) {cout << v[izxc];if(izxc+1!=v.size()) cout << ","; }cout <<"}"<< endl;} while(0)
#else
#define debug(...)
#define debugv(v)
#endif
#define lob(a,x) lower_bound(all(a),x)
#define upb(a,x) upper_bound(all(a),x)
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;
    cin >> n;
    int m = n;
    vector<vector<char>> f(n, vector<char>(m));
    for (auto &row : f) for (char &c : row) cin >> c;
    auto p =  [&](char c1, char c2) {
        return c1 == 'O' && c2 == 'O' || c1 == 'M' && c2 == 'P' || c1 == 'P' && c2 == 'M';
    };
    auto ok = [&](int i, int j) { return 0 <= i && i < n && 0 <= j && j < m; };
    auto dfs = [&](auto dfs, int i, int j) -> void {
        if (f[i][j] == 'M' || f[i][j] == 'P' || f[i][j] == 'O') {
            char c = f[i][j];
            for (int di = -1; di <= 1; ++di) for (int dj = -1; dj <= 1; ++dj) {
                if (ok(i + di, j + dj) && p(f[i][j], f[i + di][j + dj] + 'A' - 'a')) {
                    f[i+di][j + dj] += 'A' - 'a';
                    dfs(dfs, i + di, j + dj);
                }
            }
        }
    };
    int score = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            score += 2 * ('A' <= f[i][j] && f[i][j] <= 'Z');
            for (int di = -1; di <= 1; ++di) for (int dj = -1; dj <= 1; ++dj) {
                if ((di != 0 || dj != 0) && ok(i + di, j + dj)) score += p(f[i][j], f[i + di][j + dj]);
            }
        }
    }
    cout << score / 2 << ' ';
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) dfs(dfs, i, j);
    score = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            score += 2 * ('A' <= f[i][j] && f[i][j] <= 'Z');
            for (int di = -1; di <= 1; ++di) for (int dj = -1; dj <= 1; ++dj) {
                if ((di != 0 || dj != 0) && ok(i + di, j + dj)) score += p(f[i][j], f[i + di][j + dj]);
            }
        }
    }
    cout << score / 2 << '\n';
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cout << f[i][j];
        }
        cout << '\n';
    }
    return 0;
}