#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;

const ll MAX = 15;
char grid[MAX][MAX];
ll values[MAX][MAX], n;

vector<pair<ll,ll>> dir = {{0,1}, {1,0}, {0,-1}, {-1,0}, {1,1}, {-1,-1}, {-1,1}, {1,-1}};

bool valid() {
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n; j++) {
            if(grid[i][j] == '.' || isupper(grid[i][j]))
                continue;
            if(values[i][j] > 1)
                return true;
        }
    }
    return false;
}

pair<ll,ll> getMax() {
    int x = 0, y = 0;
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            if(grid[i][j] == '.' || isupper(grid[i][j]))
                continue;
            if(values[x][y] <= values[i][j]){
                x = i, y = j;
            }
        }
    }
    return {x,y};
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cin >> n;
    for(int i = 1 ; i <= n ; i++) 
        for(int j = 1 ; j <= n ; j++)
            cin >> grid[i][j];
    ll initial = 0, finalVal = 0;
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            if(grid[i][j] == '.') 
                continue;
            if(isupper(grid[i][j]))
                initial+=2;

            values[i][j] = 1;
            char curr = grid[i][j];
            for(auto [a,b] : dir) {
                char neig = grid[i+a][j+b];
                if((curr == 'o' && neig == 'O') || (curr == 'p' && neig == 'M') || (curr == 'm' && neig == 'P'))
                    values[i][j]++;
                if((curr == 'O' && neig == 'O') || (curr == 'P' && neig == 'M') || (curr == 'M' && neig == 'P'))
                    initial++;
            }
        } 
    }    
    initial /= 2;
    finalVal = initial;
    while(valid()) {
        auto [x,y] = getMax();
        finalVal += values[x][y];
        values[x][y] = 0;
        char curr = grid[x][y] = toupper(grid[x][y]);
        for(auto [a,b] : dir) {
            char neig = grid[x+a][y+b];
            if((curr == 'O' && neig == 'o') || (curr == 'P' && neig == 'm') || (curr == 'M' && neig == 'p')){
                values[x+a][y+b]++;
            }
        }
    }
    cout << initial << " " << finalVal << '\n';
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= n ; j++) {
            cout << grid[i][j];
        }
        cout << '\n';
    }
    

}