#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;

void solve([[maybe_unused]] int t)
{
  int n;
  cin >> n;

  vector mat(n, vector<char>(n));
  for (auto &i : mat)
    for (auto &j : i)
      cin >> j;

  int st = 0;
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
    {
      if (mat[i][j] < 'A' || mat[i][j] > 'Z')
        continue;
      int tmp = 2;
      for (int dx = -1; dx <= 1; dx++)
      {
        for (int dy = -1; dy <= 1; dy++)
        {
          if (dx == 0 && dy == 0)
            continue;
          if (i + dx < 0 || i + dx >= n)
            continue;
          if (j + dy < 0 || j + dy >= n)
            continue;

          int sx = i + dx, sy = j + dy;
          // if(mat[sx][sy]<'A' || mat[sx][sy]>'')
          auto c = mat[sx][sy];
          auto curr = mat[i][j];

          if (c == 'O' && curr == 'O')
            tmp++;
          if (c == 'M' && curr == 'P')
            tmp++;
          if (c == 'P' && curr == 'M')
            tmp++;
        }
      }
      st += tmp;
    }
  }
  st /= 2;

  int ans = 0;
  while (true)
  {
    int best = -1;
    int x, y;

    for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
      {
        if (mat[i][j] < 'a' || mat[i][j] > 'z')
          continue;
        int tmp = 1;
        for (int dx = -1; dx <= 1; dx++)
        {
          for (int dy = -1; dy <= 1; dy++)
          {
            if (dx == 0 && dy == 0)
              continue;
            if (i + dx < 0 || i + dx >= n)
              continue;
            if (j + dy < 0 || j + dy >= n)
              continue;

            int sx = i + dx, sy = j + dy;
            // if(mat[sx][sy]<'A' || mat[sx][sy]>'')
            auto c = mat[sx][sy];
            auto curr = mat[i][j];

            if (c == 'O' && curr == 'o')
              tmp++;
            if (c == 'M' && curr == 'p')
              tmp++;
            if (c == 'P' && curr == 'm')
              tmp++;
          }
        }
        if (tmp > best)
        {
          best = tmp;
          x = i;
          y = j;
        }
      }
    }

    if (best < 2)
      break;
    // cout << best << " " << x << " " << y << "\n";
    ans += best;
    mat[x][y] += ('A' - 'a');
  }
  cout << st << " " << st + ans << "\n";
  for (auto i : mat)
  {
    for (auto j : i)
      cout << j;
    cout << "\n";
  }
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n = 1;
  // cin >> n;
  for (int i = 1; i <= n; i++)
    solve(i);
}