#include <bits/stdc++.h>
using namespace std;
const int N = 128;
int n;
char s[N][N];
bool can[N][N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%s", s[i]);
  for (int i = -n + 1; i <= n - 1; i++) {
    for (int j = -n + 1; j <= n - 1; j++) {
      can[i + n - 1][j + n - 1] = true;
      for (int a = 0; a < n && can[i + n - 1][j + n - 1]; a++) {
        for (int b = 0; b < n && can[i + n - 1][j + n - 1]; b++)
          if (s[a][b] == 'o') {
            if (a + i < n && b + j < n && a + i >= 0 && b + j >= 0 &&
                s[a + i][b + j] == '.') {
              can[i + n - 1][j + n - 1] = false;
              break;
            }
          }
      }
      if (can[i + n - 1][j + n - 1]) {
        for (int a = 0; a < n; a++) {
          for (int b = 0; b < n; b++)
            if (s[a][b] == 'o') {
              if (a + i < n && b + j < n && a + i >= 0 && b + j >= 0 &&
                  s[a + i][b + j] != 'o') {
                s[a + i][b + j] = '*';
              }
            }
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++)
      if (s[i][j] == 'x') {
        printf("NO\n");
        return 0;
      }
  }
  printf("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)
        printf("o");
      else if (can[i][j])
        printf("x");
      else
        printf(".");
    }
    printf("\n");
  }
  return 0;
}
