#include <bits/stdc++.h>
#define x first
#define X first
#define y second
#define Y second

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

const int N = 101;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;

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

int n;
string mat[N];

int get_ans() {
	int ret = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			for (int k = 0; k < 8; ++k) {
				if (i + dx[k] < 0 || i + dx[k] >= n || j + dy[k] < 0 || j + dy[k] >= n) continue;
				char x = mat[i][j], y = mat[i + dx[k]][j + dy[k]];
				if (x == y && x == 'O') ++ret;
				if (x == 'M' && y == 'P') ++ret;
				if (x == 'P' && y == 'M') ++ret;
			}
		}
	}
	ret /= 2;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			if ('A' <= mat[i][j] && mat[i][j] <= 'Z') ++ret;
		}
	}
	return ret;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> mat[i];
	}
	
	int init_ans = get_ans();
	int cur = init_ans;
	
	for (int _ = 0; _ < n * n; ++_) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (mat[i][j] == 'm' || mat[i][j] == 'p' || mat[i][j] == 'o') {
					mat[i][j] += 'A' - 'a';
					int tmp = get_ans();
					if (tmp > cur + 1) {
						cur = tmp;
					} else mat[i][j] += 'a' - 'A';
				}
			}
		}
	}
	
	cout << init_ans << " " << cur << "\n";
	for (int i = 0; i < n; ++i) cout << mat[i] << "\n";
	
	return 0;
}