#include<bits/stdc++.h>
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=10+10;
int n,ori,op[MAXN][MAXN],flg[MAXN][MAXN];
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n,memset(op,-1,sizeof(op));
	ffor(i,1,n) {
		string S;
		cin>>S,S="&"+S;
		ffor(j,1,n) {
			if(S[j]=='p'||S[j]=='P') op[i][j]=1;
			if(S[j]=='m'||S[j]=='M') op[i][j]=2;
			if(S[j]=='o'||S[j]=='O') op[i][j]=0;
			if(S[j]=='P'||S[j]=='M'||S[j]=='O') flg[i][j]=1,ori+=2;
		}
	}
	ffor(i,1,n) ffor(j,1,n) ffor(dx,-1,1) ffor(dy,-1,1) if(abs(dx)+abs(dy)) {
		int ii=i+dx,jj=j+dy;
		if(ii<1||ii>n||jj<1||jj>n) continue ;
		if(op[ii][jj]!=-1&&op[i][j]!=-1&&(op[i][j]+op[ii][jj])%3==0&&flg[i][j]&&flg[ii][jj]) ori++;	
	}
	cout<<ori/2<<' ',ori/=2;
	while(1) {
		int Flg=0;
		ffor(i,1,n) ffor(j,1,n) if(!flg[i][j]) {
			int psl=1;
			ffor(dx,-1,1) ffor(dy,-1,1) if(abs(dx)+abs(dy)) {
				int ii=i+dx,jj=j+dy;	
				if(ii<1||ii>n||jj<1||jj>n) continue ;
				if(op[ii][jj]!=-1&&op[i][j]!=-1&&(op[i][j]+op[ii][jj])%3==0&&!flg[i][j]&&flg[ii][jj]) psl++;	
			}
			if(psl<=1) continue ;
			ori+=psl;
			flg[i][j]=1,Flg=1;
		}
		if(!Flg) break ;
	}
	cout<<ori<<'\n';
	ffor(i,1,n) {
		ffor(j,1,n) {
			if(op[i][j]==-1) cout<<'.';
			else {
				char res;
				if(op[i][j]==0) res='o';
				if(op[i][j]==1) res='p';
				if(op[i][j]==2) res='m';
				if(flg[i][j]) res+='A'-'a';
				cout<<res;	
			}
		}
		cout<<'\n';
	}
	return 0;
}