#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

bool check(char a, char b) {
    if (a == 'O' && b == 'O') {
        return true;
    }
    if (a == 'M' && b == 'P') {
        return true;
    }
    if (a == 'P' && b == 'M') {
        return true;
    }
    return false;
}

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

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector<std::string> s(n);
    for (int i = 0; i < n; i++) {
        std::cin >> s[i];
    }
    
    std::queue<std::array<int, 2>> q;
    
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (std::isupper(s[i][j])) {
                q.push({i, j});
                ans++;
                for (int k = 0; k < 4; k++) {
                    int x = i + dx[k];
                    int y = j + dy[k];
                    if (0 <= x && x < n && 0 <= y && y < n && check(s[i][j], s[x][y])) {
                        ans++;
                    }
                }
            }
        }
    }
    std::cout << ans << " ";
    
    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        
        for (int k = 0; k < 8; k++) {
            int nx = x + dx[k];
            int ny = y + dy[k];
            if (0 <= nx && nx < n && 0 <= ny && ny < n && std::islower(s[nx][ny]) && check(s[x][y], std::toupper(s[nx][ny]))) {
                s[nx][ny] = std::toupper(s[nx][ny]);
                q.push({nx, ny});
            }
        }
    }
    
    ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (std::isupper(s[i][j])) {
                q.push({i, j});
                ans++;
                for (int k = 0; k < 4; k++) {
                    int x = i + dx[k];
                    int y = j + dy[k];
                    if (0 <= x && x < n && 0 <= y && y < n && check(s[i][j], s[x][y])) {
                        ans++;
                    }
                }
            }
        }
    }
    std::cout << ans << "\n";
    
    for (int i = 0; i < n; i++) {
        std::cout << s[i] << "\n";
    }
    
    return 0;
}