#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
long long n;
string s[MAXN], c[MAXN], ans[MAXN];
vector<pair<long long, long long> > o;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> s[i];
    for (long long j = 0; j < n; j++) {
      c[i] += '.';
      if (s[i][j] == 'o') {
        o.push_back(make_pair(i, j));
      }
    }
  }
  for (long long i = 0; i < 2 * n - 1; i++) {
    for (long long j = 0; j < 2 * n - 1; j++) {
      ans[i] += 'x';
    }
  }
  for (long long dx = -(n - 1); dx <= n - 1; dx++) {
    for (long long dy = -(n - 1); dy <= n - 1; dy++) {
      for (long long k = 0; k < o.size(); k++) {
        if (o[k].first + dx >= 0 && o[k].first + dx < n &&
            o[k].second + dy >= 0 && o[k].second + dy < n) {
          if (s[o[k].first + dx][o[k].second + dy] == '.') {
            ans[dx + n - 1][dy + n - 1] = '.';
            break;
          }
        }
      }
    }
  }
  ans[n - 1][n - 1] = 'o';
  for (long long k = 0; k < o.size(); k++) {
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        if (ans[i - o[k].first + n - 1][j - o[k].second + n - 1] == 'x') {
          c[i][j] = 'x';
        }
      }
    }
  }
  for (long long k = 0; k < o.size(); k++) {
    c[o[k].first][o[k].second] = 'o';
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (c[i][j] != s[i][j]) {
        cout << "NO";
        return 0;
      }
    }
  }
  cout << "YES" << endl;
  for (long long i = 0; i < 2 * n - 1; i++) {
    for (long long j = 0; j < 2 * n - 1; j++) {
      cout << ans[i][j];
    }
    cout << endl;
  }
  return 0;
}
