#include <bits/stdc++.h>
using namespace std;
int t,n;char s[15][15];
int dxy[8][2]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}};
int score()
{
	int ans=0;
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)ans+='A'<=s[i][j]&&s[i][j]<='Z';
	}
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)
		{
			for(int _=0;_<4;++_)
			{
				int ni=i+dxy[_][0],nj=j+dxy[_][1];
				if(ni>0&&nj>0&&ni<=n&&nj<=n&&(s[i][j]=='O'&&s[ni][nj]=='O'||s[i][j]=='M'&&s[ni][nj]=='P'||s[i][j]=='P'&&s[ni][nj]=='M'))++ans;
			}
		}
	}
	return ans;
}
int main()
{
		scanf("%d",&n);
		for(int i=1;i<=n;++i)scanf("%s",s[i]+1);
		int fir=score();
		int cur=fir;
		while(1)
		{
			int mx=0,I=0,J=0;//printf("new round\n");
			for(int i=1;i<=n;++i)
			{
				for(int j=1;j<=n;++j)if('a'<=s[i][j]&&s[i][j]<='z')
				{
					s[i][j]=s[i][j]-'a'+'A';
					int nxt=score();
					// printf("(%d,%d):%d\n",i,j,nxt);
					if(nxt>mx){mx=nxt,I=i,J=j;}
					s[i][j]=s[i][j]-'A'+'a';
				}
			}
			if(mx<=cur+1)break;
			s[I][J]=s[I][J]-'a'+'A';
			cur=score();
		}
		printf("%d %d\n",fir,score());
		for(int i=1;i<=n;++i)printf("%s\n",s[i]+1);
	fclose(stdin);fclose(stdout);return 0;
}