#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m, b, num;
long long a[1009][1009], cnt[1009];
multiset<long long> st, otst;
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      cin >> k;
      cnt[k]++;
    }
  }
  for (i = 1; i <= 1000; i++) {
    if (cnt[i] == 0) continue;
    if (cnt[i] % 4 == 0) {
      for (j = 1; j <= cnt[i]; j++) st.insert(i);
    } else {
      for (j = 1; j <= cnt[i]; j++) otst.insert(i);
    }
  }
  num = -1;
  if (n % 2 == 1) {
    for (auto to : otst) {
      if (otst.count(to) % 2 == 1) {
        a[n / 2 + 1][n / 2 + 1] = to;
        num = to;
        break;
      }
    }
    if (num == -1) return cout << "NO" << endl, 0;
    otst.erase(otst.find(num));
    cnt[num]--;
    long long last = -1;
    for (i = 1; i <= n / 2; i++) {
      last = -1;
      for (j = 1; j <= 1000; j++) {
        if (cnt[j] % 2 == 1 || cnt[j] < 0) return cout << "NO" << endl, 0;
        if (cnt[j] == 0) continue;
        if (cnt[j] % 4 != 0) {
          last = j;
          break;
        } else
          last = j;
      }
      if (last == -1) return cout << "NO" << endl, 0;
      a[n / 2 + 1][i] = last;
      a[(n / 2 + 1)][n - i + 1] = last;
      cnt[last] -= 2;
    }
    for (i = 1; i <= n / 2; i++) {
      last = -1;
      for (j = 1; j <= 1000; j++) {
        if (cnt[j] % 2 == 1 || cnt[j] < 0) return cout << "NO" << endl, 0;
        if (cnt[j] == 0) continue;
        if (cnt[j] % 4 != 0) {
          last = j;
          break;
        } else
          last = j;
      }
      if (last == -1) return cout << "NO" << endl, 0;
      a[i][n / 2 + 1] = last;
      a[n - i + 1][(n / 2 + 1)] = last;
      cnt[last] -= 2;
    }
  }
  for (i = 1; i <= n / 2; i++) {
    for (j = 1; j <= n / 2; j++) {
      long long last = -1;
      for (int k = 1; k <= 1000; k++) {
        if (cnt[k] < 0 || cnt[k] % 2 == 1) return cout << "NO" << endl, 0;
        if (cnt[k] == 0) continue;
        last = k;
        if (cnt[k] % 4 != 0) return cout << "NO" << endl, 0;
        break;
      }
      a[i][j] = last;
      a[n - i + 1][j] = last;
      a[n - i + 1][n - j + 1] = last;
      a[i][n - j + 1] = last;
      cnt[last] -= 4;
    }
  }
  cout << "YES" << endl;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      cout << a[i][j] << ' ';
    }
    cout << endl;
  }
  return 0;
}
