#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  map<long long, long long> mp;
  for (long long i = 0; i < n * n; i++) {
    long long x;
    cin >> x;
    mp[x]++;
  }
  long long vis[n][n], ans[n][n];
  memset(vis, 0, sizeof(vis));
  memset(ans, 0, sizeof(ans));
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      long long req = 0;
      if (vis[i][j] == 0) {
        req++;
        vis[i][j] = 1;
      }
      if (vis[n - i - 1][j] == 0) {
        req++;
        vis[n - i - 1][j] = 1;
      }
      if (vis[i][n - j - 1] == 0) {
        req++;
        vis[i][n - j - 1] = 1;
      }
      if (vis[n - i - 1][n - j - 1] == 0) {
        req++;
        vis[n - i - 1][n - j - 1] = 1;
      }
      if (req == 0) continue;
      long long val = 0, diff = 1e9;
      for (auto &it : mp) {
        if (it.second % 2 == req % 2 && it.second >= req) {
          if (it.second - req < diff) {
            val = it.first;
            diff = it.second - req;
          }
        }
      }
      if (val == 0) {
        for (auto &it : mp) {
          if (it.second >= req && it.second - req < diff) {
            val = it.first;
            diff = it.second - req;
          }
        }
      }
      if (val) mp[val] -= req;
      if (ans[i][j] == 0) {
        ans[i][j] = val;
      }
      if (ans[n - i - 1][j] == 0) {
        ans[n - i - 1][j] = val;
      }
      if (ans[i][n - j - 1] == 0) {
        ans[i][n - j - 1] = val;
      }
      if (ans[n - i - 1][n - j - 1] == 0) {
        ans[n - i - 1][n - j - 1] = val;
      }
    }
  }
  bool ok = false;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) ok |= ans[i][j] == 0;
  }
  if (ok)
    cout << "NO"
         << "\n";
  else {
    cout << "YES"
         << "\n";
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) cout << ans[i][j] << " ";
      cout << "\n";
    }
  }
  return 0;
}
