#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
#define fi first 
#define se second
#define all(v) v.begin(),v.end()
using namespace std;
const int inf = 0x3f3f3f3f3f3f3f;
const int N = 105;
int n;
char a[N][N];
char b[N][N];
int dx[] = {-1,-1,-1,0,0,1,1,1};
int dy[] = {-1,0,1,-1,1,-1,0,1};

void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        for(int j=1;j<=n;j++){
            a[i][j] = s[j-1];
            b[i][j] = '.';
        }
    }

    int ans = 0;
    int c1 = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j] == 'M' || a[i][j] == 'P' || a[i][j] == 'O')ans++;
            for(int k=0;k<8;k++){
                int nx = i + dx[k];
                int ny = j + dy[k];
                if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                if(a[nx][ny] == 'O' && a[i][j] == 'O')c1++;
                if(a[nx][ny] == 'M' && a[i][j] == 'P')c1++;
                if(a[nx][ny] == 'P' && a[i][j] == 'M')c1++;
            }
        }
    }

    c1 /= 2LL;
    ans += c1;
    cout<<ans<<" ";

    while(true){
        bool flag = true;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j] != b[i][j]){
                    flag = false;
                }
            }
        }
        if(flag)break;

        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                b[i][j] = a[i][j];
            }
        }

        bool f = false;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j] == 'o' || a[i][j] == 'm' || a[i][j] == 'p'){
                    for(int k=0;k<8;k++){
                        int nx = i + dx[k];
                        int ny = j + dy[k];
                        if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                        if(a[i][j] == 'o' && a[nx][ny] == 'O'){
                            a[i][j] = 'O';
                            f = true;
                        }
                        if(a[i][j] == 'm' && a[nx][ny] == 'P'){
                            a[i][j] = 'M';
                            f = true;
                        }
                        if(a[i][j] == 'p' && a[nx][ny] == 'M'){
                            a[i][j] = 'P';
                            f = true;
                        }
                        if(f)break;
                    }
                }
                if(f)break;
            }
            if(f)break;
        }

    }

    ans = 0;
    c1 = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j] == 'M' || a[i][j] == 'P' || a[i][j] == 'O')ans++;
            for(int k=0;k<8;k++){
                int nx = i + dx[k];
                int ny = j + dy[k];
                if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                if(a[nx][ny] == 'O' && a[i][j] == 'O')c1++;
                if(a[nx][ny] == 'M' && a[i][j] == 'P')c1++;
                if(a[nx][ny] == 'P' && a[i][j] == 'M')c1++;
            }
        }
    }

    c1 /= 2LL;
    ans += c1;
    cout<<ans<<"\n";

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<a[i][j];
        }
        cout<<"\n";
    }

    return;

}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int T = 1;
    //cin>>T;
    while(T--){
        solve();
    }
    return 0;
}