//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
string grid[15];
int getscore(int n)
{
	int sc=0;
	for(int i=0;i<n;i++)
		for(auto ch:grid[i])
			if(isupper(ch))
				sc++;
	sc*=2;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			for(int dx=-1;dx<=1;dx++)
				for(int dy=-1;dy<=1;dy++) if(dx||dy)
				{
					int nx=i+dx;
					int ny=j+dy;
					if(nx<0||ny<0||nx>=n||ny>=n) continue;
					if(grid[i][j]=='O'&&grid[nx][ny]=='O') sc++;
					if(grid[i][j]=='M'&&grid[nx][ny]=='P') sc++;
					if(grid[i][j]=='P'&&grid[nx][ny]=='M') sc++;
				}
	return sc/2;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>grid[i];
	int score=getscore(n);
	queue<int> q;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(isupper(grid[i][j]))
			{
				q.push(i);
				q.push(j);
			}
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		int y=q.front();
		q.pop();
		char target;
		if(grid[x][y]=='O') target='o';
		if(grid[x][y]=='M') target='p';
		if(grid[x][y]=='P') target='m';
		for(int dx=-1;dx<=1;dx++)
			for(int dy=-1;dy<=1;dy++)
			{
				int nx=x+dx;
				int ny=y+dy;
				if(nx<0||ny<0||nx>=n||ny>=n) continue;
				if(grid[nx][ny]==target)
				{
					grid[nx][ny]=toupper(grid[nx][ny]);
					q.push(nx);
					q.push(ny);
				}
			}
		
	}
	int final=getscore(n);
	cout<<score<<" "<<final<<'\n';
	for(int i=0;i<n;i++)
		cout<<grid[i]<<'\n';
	return 0;
}