#include<bits/stdc++.h>

using namespace std;   

#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)

int n;
vector<string> p;

bool read()
{
	if (!(cin >> n))
		return false;
	p.resize(n);
	fore (i, 0, n)
		cin >> p[i];
	return true;
}

int dx[] = { -1, -1, 0, 1, 1, 1, 0, -1 };
int dy[] = { 0, 1, 1, 1, 0, -1, -1, -1 };

int check(char a, char b) {
	if (a == '.' || b == '.')
		return 0;
	if (islower(a) || islower(b))
		return 0;
	if (a == 'O' && b == 'O')
		return 1;
	if (a == 'M' && b == 'P')
		return 1;
	if (a == 'P' && b == 'M')
		return 1;
	return 0;	
}

bool inside(int x, int y) {
	return 0 <= x && x < n && 0 <= y && y < n;
}

void solve()
{
	int init = 0;
	fore (x, 0, n) fore (y, 0, n) fore (k, 0, 4) {
		int nx = x + dx[k];
		int ny = y + dy[k];
		if (inside(nx, ny))
			init += check(p[x][y], p[nx][ny]);
	}
	fore (x, 0, n) fore (y, 0, n)
		if (p[x][y] != '.' && isupper(p[x][y]))
			init++;
	cout << init;
	
	while (true) {
		int mx = -1;
		int cx = -1, cy = -1;
		fore (x, 0, n) fore (y, 0, n) {
			if (p[x][y] == '.' || isupper(p[x][y]))
				continue;
			p[x][y] = toupper(p[x][y]);
			int cur = 0;
			fore (k, 0, 8) {
				int nx = x + dx[k];
				int ny = y + dy[k];
				if (inside(nx, ny))
					cur += check(p[x][y], p[nx][ny]);
			}
			if (mx < cur) {
				mx = cur;
				cx = x, cy = y;
			}
			p[x][y] = tolower(p[x][y]);
		}
		if (mx <= 0)
			break;
		
		init += 1 + mx;
		p[cx][cy] = toupper(p[cx][cy]);
	}
	
	cout << " " << init << endl;
	fore (i, 0, n)
		cout << p[i] << endl;
}

int main()
{
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	forn(i, t)
	{
	 	read();
		solve();
	}
}