#include<iostream>
#include<cstdio>
#include<fstream>
#include<queue>
#include<algorithm>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
//#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif

using namespace std;

int n;

struct board {
	string s[15];
	static int calc(char a, char b) {
		return (a == b && a == 'O') || (min(a, b) == 'M' && max(a, b) == 'P');
	}
	string& operator[](int i) {
		return s[i];
	}
	int score() {
		int cnt = 0;
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				if(s[i][j] >= 'A' && s[i][j] <= 'Z') cnt++;
				if(i < n) cnt += calc(s[i][j], s[i + 1][j]);
				if(j < n) cnt += calc(s[i][j], s[i][j + 1]);
				if(i < n && j < n) cnt += calc(s[i][j], s[i + 1][j + 1]);
				if(i < n && j > 1) cnt += calc(s[i][j], s[i + 1][j - 1]);
			}
		}
		return cnt;
	}
	board build(int x, int y) {
		board b = *this;
		if(b[x][y] >= 'a' && b[x][y] <= 'z') {
			b[x][y] ^= 32;
		}
		return b;
	}
} a;

void work() {
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] = " " + a[i];
	}
	int p = a.score();
	cout << p << ' ';
	for(int i = 1; i <= n * n; i++) {
		int mx = 0;
		for(int j = 1; j <= n; j++) {
			for(int k = 1; k <= n; k++) {
				mx = max(mx, a.build(j, k).score() - p);
			}
		}
		if(mx >= 2) {
			int flg = 0;
			for(int j = 1; j <= n; j++) {
				for(int k = 1; k <= n; k++) {
					if(mx == a.build(j, k).score() - p) {
						a = a.build(j, k);
						p += mx;
						flg = 1;
						break;
					}
				}
				if(flg) break;
			}
			if(flg) continue;
		}
		else break;
	}
	cout << p << '\n';
	for(int i = 1; i <= n; i++) {
		cout << a[i].substr(1) << '\n';
	}
	return ;
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int _ = 1;
//	cin >> _;
	while(_--) work();
}