#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> ax, ay;
vector<int> px, py, qx, qy;
char a[100][100];
char grid[100][100];
int x, y;
bool onGrid(int r, int c) { return (0 <= r && r < n && 0 <= c && c < n); }
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
      if (a[i][j] == 'o') {
        px.push_back(i);
        py.push_back(j);
      }
      if (a[i][j] == 'x') {
        qx.push_back(i);
        qy.push_back(j);
      }
    }
  }
  for (int dx = -n + 1; dx <= n - 1; dx++) {
    for (int dy = -n + 1; dy <= n - 1; dy++) {
      bool possible = true;
      for (int i = 0; i < px.size(); i++) {
        x = px[i] + dx;
        y = py[i] + dy;
        if (onGrid(x, y) && a[x][y] == '.') {
          possible = false;
          break;
        }
      }
      if (possible) {
        ax.push_back(dx);
        ay.push_back(dy);
      }
    }
  }
  bool solvable = true;
  for (int i = 0; i < qx.size(); i++) {
    bool covered = false;
    for (int j = 0; j < ax.size(); j++) {
      x = qx[i] - ax[j];
      y = qy[i] - ay[j];
      if (onGrid(x, y) && a[x][y] == 'o') covered = true;
    }
    if (!covered) {
      solvable = false;
    }
  }
  if (!solvable)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 0; i < 2 * n - 1; i++) {
      for (int j = 0; j < 2 * n - 1; j++) {
        if (i == n - 1 && j == n - 1)
          cout << "o";
        else {
          bool covered = false;
          for (int k = 0; k < ax.size(); k++) {
            x = i - ax[k];
            y = j - ay[k];
            if (onGrid(x, y) && x == n - 1 && y == n - 1) covered = true;
          }
          if (covered)
            cout << "x";
          else
            cout << ".";
        }
      }
      cout << endl;
    }
  }
}
