#include <bits/stdc++.h>

#define i64 long long

using namespace std;

const int N = 15;

int n;
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
char a[N][N];
queue<pair<int, int> > q;

int Get(int Fir, int Sec) {
	int Res = 0;
	for (int i = 0; i < 8; i ++) {
		int x = Fir + dx[i], y = Sec + dy[i];
		if (x < 1 || n < x || y < 1 || n < y) continue;
		if (a[x][y] == 'O' && a[Fir][Sec] == 'O') Res ++;
		if (a[x][y] == 'P' && a[Fir][Sec] == 'M') Res ++;
		if (a[x][y] == 'M' && a[Fir][Sec] == 'P') Res ++;
	}
	return Res;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) scanf("%s", a[i] + 1);
	
	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') {
				q.push(make_pair(i, j));
			}
		}
	}
	
	int Tmp = 0, Ans = 0;
	while (q.size()) {
		pair<int, int> Tp = q.front();
		q.pop();
		for (int i = 0; i < 8; i ++) {
			int x = Tp.first + dx[i], y = Tp.second + dy[i];
			if (x < 1 || n < x || y < 1 || n < y) continue;
			if (a[x][y] != '.') {
				if (a[Tp.first][Tp.second] == 'O' && a[x][y] == 'o') {
					a[x][y] = 'O';
					Tmp ++;
					q.push(make_pair(x, y));
				}
				if (a[Tp.first][Tp.second] == 'M' && a[x][y] == 'p') {
					a[x][y] = 'P';
					Tmp ++;
					q.push(make_pair(x, y));
				}
				if (a[Tp.first][Tp.second] == 'P' && a[x][y] == 'm') {
					a[x][y] = 'M';
					Tmp ++;
					q.push(make_pair(x, y));
				}
			}
		}
	}
	
	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= n; j ++) {
			Ans += Get(i, j);
		}
	}
	Ans /= 2;
	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= n; j ++) {
			if (a[i][j] == 'O' || a[i][j] == 'P' || a[i][j] == 'M') Ans ++;
		}
	}
	
	printf("%d %d\n", Tmp, Ans);
	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= n; j ++) {
			printf("%c", a[i][j]);
		}
		putchar('\n');
	}
	
	return 0;
}