#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 4;
template <typename T, typename... V>
inline void wonl(T t, V... v) {
  ww(t);
  if (sizeof...(v)) putchar(' ');
  wonl(v...);
}
void solve() {
  int n;
  cin >> n;
  vector<int> arr(1001);
  for (int i = 0; i < n * n; i++) {
    int a;
    cin >> a;
    arr[a]++;
  }
  vector<int> ans[n];
  for (int i = 0; i < n; i++) ans[i].resize(n);
  int n1 = n, i = 0;
  while (n1 > 0) {
    int tmp = -1;
    if (n1 == 1) {
      for (int j = 0; j <= 1000; j++) {
        if (arr[j] >= 1) {
          arr[j] -= 1;
          tmp = j;
          break;
        }
      }
      if (tmp == -1) {
        cout << "NO" << endl;
        return;
      }
      ans[i][i] = tmp;
      break;
    }
    tmp = -1;
    for (int j = 0; j <= 1000; j++) {
      if (arr[j] >= 4) {
        arr[j] -= 4;
        tmp = j;
        break;
      }
    }
    if (tmp == -1) {
      cout << "NO" << endl;
      return;
    }
    ans[i][n - i - 1] = ans[i][i] = ans[n - 1 - i][n - 1 - i] =
        ans[n - i - 1][i] = tmp;
    for (int j = 1; j < n1 / 2; j++) {
      tmp = -1;
      for (int k = 0; k <= 1000; k++) {
        if (arr[k] >= 4) {
          arr[k] -= 4;
          tmp = k;
          break;
        }
      }
      if (tmp == -1) {
        cout << "NO" << endl;
        return;
      }
      ans[i][i + j] = ans[i][n - i - 1 - j] = ans[n - i - 1][i + j] =
          ans[n - i - 1][n - i - 1 - j] = tmp;
      tmp = -1;
      for (int k = 0; k <= 1000; k++) {
        if (arr[k] >= 4) {
          arr[k] -= 4;
          tmp = k;
          break;
        }
      }
      if (tmp == -1) {
        cout << "NO" << endl;
        return;
      }
      ans[i + j][i] = ans[i + j][n - i - 1] = ans[n - i - 1 - j][i] =
          ans[n - 1 - i - j][n - 1 - i] = tmp;
    }
    if (n1 % 2) {
      tmp = -1;
      int tmp2 = -1;
      for (int j = 0; j <= 1000; j++) {
        if (arr[j] >= 2) {
          tmp = j;
        }
        if (arr[j] == 2) {
          tmp2 = j;
          break;
        }
      }
      if (tmp == -1 && tmp2 == -1) {
        cout << "NO" << endl;
        return;
      }
      if (tmp2 != -1) tmp = tmp2;
      arr[tmp] -= 2;
      ans[i][i + n1 / 2] = ans[n - i - 1][i + n1 / 2] = tmp;
      tmp = -1, tmp2 = -1;
      for (int j = 0; j <= 1000; j++) {
        if (arr[j] >= 2) {
          tmp = j;
        }
        if (arr[j] == 2) {
          tmp2 = j;
          break;
        }
      }
      if (tmp == -1 && tmp2 == -1) {
        cout << "NO" << endl;
        return;
      }
      if (tmp2 != -1) tmp = tmp2;
      arr[tmp] -= 2;
      ans[i + n1 / 2][i] = ans[n - i - 1 - n1 / 2][n - i - 1] = tmp;
    }
    n1 -= 2;
    i++;
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << ans[i][j] << " ";
    }
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
