#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  vector<string> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<vector<bool> > m(2 * n, vector<bool>(2 * n, true));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if (a[i][j] == '.')
        for (int x = 0; x < n; x++)
          for (int y = 0; y < n; y++)
            if (a[x][y] == 'o') {
              m[n + i - x][n + j - y] = false;
            }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if (a[i][j] == 'x') {
        bool good = false;
        for (int x = 0; x < n; x++)
          for (int y = 0; y < n; y++)
            if (a[x][y] == 'o') {
              good = (m[n + i - x][n + j - y] ? true : good);
            }
        if (!good) {
          cout << "NO";
          return 0;
        }
      }
  cout << "YES\n";
  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";
        continue;
      }
      if (m[i + 1][j + 1])
        cout << "x";
      else
        cout << ".";
    }
    cout << "\n";
  }
  return 0;
}
