#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 20;

int n;
string s[maxn];

char opt(char x) {
  if (x == 'O') return 'O';
  if (x == 'M') return 'P';
  if (x == 'P') return 'M';
}

bool check(int x, int y, char c) {
  rep (dx, x - 1, x + 1) rep (dy, y - 1, y + 1) {
    if (dx == x && dy == y) continue;
    if (dx >= 1 && dx <= n && dy >= 1 && dy <= n && s[dx][dy] == c) return true;
  }
  return false;
}

int calc() {
  int ans = 0;
  rep (i, 1, n) rep (j, 1, n) if (isupper(s[i][j])) ans++;
  rep (i, 1, n) rep (j, 1, n - 1) if (isupper(s[i][j]) && opt(s[i][j]) == s[i][j + 1]) ans++;
  rep (i, 1, n - 1) rep (j, 1, n) if (isupper(s[i][j]) && opt(s[i][j]) == s[i + 1][j]) ans++;
  rep (i, 1, n - 1) rep (j, 1, n - 1) if (isupper(s[i][j]) && opt(s[i][j]) == s[i + 1][j + 1]) ans++;
  rep (i, 1, n - 1) rep (j, 1, n - 1) if (isupper(s[i + 1][j]) && opt(s[i + 1][j]) == s[i][j + 1]) ans++;
  return ans;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) cin >> s[i], s[i] = " "s + s[i];
  int cost = calc();
  while (true) {
    int ok = 0;
    rep (i, 1, n) rep (j, 1, n) if (islower(s[i][j]) && check(i, j, opt(s[i][j] - 'a' + 'A'))) s[i][j] = s[i][j] - 'a' + 'A', ok = 1;
    if (!ok) break;
  }
  cout << cost << " " << calc() << '\n';
  rep (i, 1, n) {
    rep (j, 1, n) cout << s[i][j];
    cout << '\n';
  }
}