#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
char A[20][20];

bool check(char a, char b) {
  if (a == 'M' && b == 'P') return true;
  if (a == 'P' && b == 'M') return true;
  if (a == 'O' && b == 'O') return true;
  return false;
}
int calc() {
  int ret = 0;
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (isupper(A[x][y])) {
    ++ret;
    for (int dx = -1; dx <= +1; ++dx) for (int dy = -1; dy <= +1; ++dy) if (make_pair(dx, dy) > make_pair(0, 0)) {
      const int xx = x + dx;
      const int yy = y + dy;
      if (0 <= xx && xx < N && 0 <= yy && yy < N && check(A[x][y], A[xx][yy])) ++ret;
    }
  }
  return ret;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < N; ++x) {
      scanf("%s", A[x]);
    }
    
    const int ini = calc();
    int now = ini;
    for (; ; ) {
      int mx = -1;
      int xm = -1, ym = -1;
      for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (islower(A[x][y])) {
        A[x][y] = toupper(A[x][y]);
        if (chmax(mx, calc())) {
          xm = x;
          ym = y;
        }
        A[x][y] = tolower(A[x][y]);
      }
      if (mx <= now + 1) {
        break;
      }
      now = mx;
      A[xm][ym] = toupper(A[xm][ym]);
    }
    printf("%d %d\n", ini, now);
    for (int x = 0; x < N; ++x) {
      puts(A[x]);
    }
  }
  return 0;
}