#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
long long int max(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
long long int min(long long int a, long long int b) {
  if (a < b)
    return a;
  else
    return b;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int t, i, j, x, l, r, n, m, k, y;
  cin >> n;
  map<long long int, long long int> mpp;
  for (i = 0; i < n * n; i++) {
    cin >> x;
    mpp[x]++;
  }
  long long int arr[n][n];
  long long int mid = n / 2;
  for (i = 0; i < mid; i++) {
    for (j = 0; j < mid; j++) {
      long long int val = -1;
      for (auto itr = mpp.begin(); itr != mpp.end(); itr++) {
        if (itr->second >= 4) {
          val = itr->first;
          break;
        }
      }
      if (val == -1) {
        cout << "NO";
        return 0;
      }
      mpp[val] -= 4;
      arr[i][j] = val;
      arr[i][n - j - 1] = val;
      arr[n - i - 1][j] = val;
      arr[n - i - 1][n - j - 1] = val;
    }
  }
  if (n % 2 == 1) {
    for (j = 0; j < mid; j++) {
      long long int val = -1;
      for (auto itr = mpp.begin(); itr != mpp.end(); itr++) {
        if (itr->second >= 2) {
          val = itr->first;
          break;
        }
      }
      if (val == -1) {
        cout << "NO";
        return 0;
      }
      mpp[val] -= 2;
      arr[mid][j] = val;
      arr[mid][n - j - 1] = val;
    }
    for (i = 0; i < mid; i++) {
      long long int val = -1;
      for (auto itr = mpp.begin(); itr != mpp.end(); itr++) {
        if (itr->second >= 2) {
          val = itr->first;
          break;
        }
      }
      if (val == -1) {
        cout << "NO";
        return 0;
      }
      mpp[val] -= 2;
      arr[i][mid] = val;
      arr[n - i - 1][mid] = val;
    }
    long long int val = -1;
    for (auto itr = mpp.begin(); itr != mpp.end(); itr++) {
      if (itr->second >= 1) {
        val = itr->first;
        break;
      }
    }
    if (val == -1) {
      cout << "NO";
      return 0;
    }
    mpp[val] -= 1;
    arr[mid][mid] = val;
  }
  cout << "YES"
       << "\n";
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      cout << arr[i][j] << " ";
    }
    cout << "\n";
  }
}
