#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const int dx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

void solve() {
    int n;
    cin >> n;
    vector<string> S(n);
    for (int i = 0; i < n; i++) {
        cin >> S[i];
    }

    auto isin = [&](int x, int y) { return 0 <= x and x < n and 0 <= y and y < n; };
    auto calc = [&](int x, int y) -> int {
        if (S[x][y] == '.') {
            return 0;
        }
        if (not isupper(S[x][y])) {
            return 0;
        }
        int res = 0;
        for (int i = 0; i < 8; i++) {
            int nx = x + dx[i], ny = y + dy[i];
            if (not isin(nx, ny)) {
                continue;
            }
            res += (S[x][y] == 'O' and S[nx][ny] == 'O');
            res += (S[x][y] == 'M' and S[nx][ny] == 'P');
            res += (S[x][y] == 'P' and S[nx][ny] == 'M');
        }
        return res;
    };
    int score = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            score += calc(i, j);
        }
    }
    assert(~score & 1);
    score /= 2;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (isupper(S[i][j])) {
                score++;
            }
        }
    }
    int init = score;
    while (true) {
        int maxi = 0, X = -1, Y = -1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (not islower(S[i][j])) {
                    continue;
                }
                S[i][j] = toupper(S[i][j]);
                if (chmax(maxi, calc(i, j))) {
                    X = i, Y = j;
                }
                S[i][j] = tolower(S[i][j]);
            }
        }
        if (maxi == 0) {
            break;
        }
        score += maxi + 1;
        S[X][Y] = toupper(S[X][Y]);
    }

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}