#include"bits/stdc++.h"

using namespace std;

using pii = pair<int, int>;
vector<pii> dir = {
    {0, 1},
    {0, -1},
    {1, 0},
    {-1, 0},
    {1,1},
    {-1,1},
    {1,-1},
    {-1,-1}
};



int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin>>n;
    vector<string> g(n);
    for(auto & s: g) cin>>s;

    vector<vector<bool>> vis(n, vector<bool>(n));
    auto inGrid = [&](int i, int j) -> bool {
        if(i < 0 || i >= n) return false;
        if(j < 0 || j >= n) return false;
        return true;
    };
    auto cntNei = [&](int i, int j, char x) -> int {
        int c = 0;
        for(auto [da, db] : dir){
            int a = i + da;
            int b = j + db;
            if(inGrid(a, b) && g[a][b] == x) c++;
        }
        return c;
    };

    auto calc = [&]()->int{
        int a = 0, b=0;
        for(int i =0; i < n; i++){
            for(int j =0; j <n; j++){
                if(g[i][j] == 'O'){
                    a++;
                    b += cntNei(i, j, 'O');
                }
                if(g[i][j] == 'M'){
                    a++;
                    b += cntNei(i, j, 'P');
                }
                if(g[i][j] == 'P'){
                    a++;
                    b += cntNei(i, j, 'M');
                }

            }
        }
        return a + b/2;
    };
    cout<<calc()<<" ";

    vector<pii> bfs;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++){
            if(g[i][j] == 'o' && cntNei(i, j, 'O')){
                vis[i][j] = true;
                bfs.emplace_back(i, j);
            }
            else if(g[i][j] == 'm' && cntNei(i, j, 'P')){
                vis[i][j] = true;
                bfs.emplace_back(i, j);
            }
            else if(g[i][j] == 'p' && cntNei(i, j, 'M')){
                vis[i][j] = true;
                bfs.emplace_back(i, j);
            }
        }
    for(int _ = 0; _ < bfs.size(); _++){
        auto [i, j] = bfs[_];
        g[i][j] += 'A' - 'a';
        for(auto [da, db] : dir){
            int a = i + da;
            int b = j + db;
            if(!inGrid(a,b)) continue;
            if(vis[a][b]) continue;
            if(g[a][b] == '.') continue;
            if(g[a][b] == 'o' && g[i][j] == 'O'){
                vis[a][a] = true;
                bfs.emplace_back(a, b);            
            }
            if(g[a][b] == 'm' && g[i][j] == 'P'){
                vis[a][a] = true;
                bfs.emplace_back(a, b);                 
            }
            if(g[a][b] == 'p' && g[i][j] == 'M'){
                vis[a][a] = true;
                bfs.emplace_back(a, b);               
            }
        }
    }
    cout<<calc()<<"\n";
    for(auto s : g){
        cout<<s<<"\n";
    }
    return 0;
}