#include <bits/stdc++.h>
#define lzm0107
using namespace std;
using LL = long long;
using AI2 = array<int, 2>;
using PII = pair<int, int>;
using ULL = unsigned long long;
const int N = 1e1 + 10;
const int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1}, dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

struct data{
	int x, y;
};

int n;
char mp[N][N];

int calc_score(){
	int res = 0;
	for(int i = 1; i <= n; i ++ ){
		for(int j = 1; j <= n; j ++ ){
			res += 'A' <= mp[i][j] && mp[i][j] <= 'Z';
			for(int nx, ny, k = 1; k < 5; k ++ ){
				nx = i + dx[k], ny = j + dy[k];
				if(1 <= nx && nx <= n && 1 <= ny && ny <= n){
					if(mp[i][j] == 'M' && mp[nx][ny] == 'P' || mp[i][j] == 'P' && mp[nx][ny] == 'M' || mp[i][j] == 'O' && mp[nx][ny] == 'O') res ++ ;
				}
			}
		}
	}
	return res;
}

int main(){
	ios::sync_with_stdio(false);
	*cin.tie(nullptr) << fixed << setprecision(20);
	
	cin >> n;
	queue<data> que;
	for(int i = 1; i <= n; i ++ ){
		for(int j = 1; j <= n; j ++ ){
			cin >> mp[i][j];
			if('A' <= mp[i][j] && mp[i][j] <= 'Z') que.push(data{i, j});
		}
	}
	cout << calc_score() << ' ';
	while(!que.empty()){
		int x = que.front().x, y = que.front().y;
		que.pop();
		for(int nx, ny, i = 0; i < 8; i ++ ){
			nx = x + dx[i], ny = y + dy[i];
			if(1 <= nx && nx <= n && 1 <= ny && ny <= n){
				if(mp[nx][ny] == 'p' && mp[x][y] == 'M' || mp[nx][ny] == 'm' && mp[x][y] == 'P' || mp[nx][ny] == 'o' && mp[x][y] == 'O'){
					mp[nx][ny] -= 'a' - 'A';
					que.push(data{nx, ny});
				}
			}
		}
	}
	cout << calc_score() << '\n';
	for(int i = 1; i <= n; i ++ ){
		for(int j = 1; j <= n; j ++ ){
			cout << mp[i][j];
		}
		cout << '\n';
	}
	return 0;
}