#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
T &minn(T &a, T b) {
  if (b < a) a = b;
  return a;
}
template <class T>
T &maxx(T &a, T b) {
  if (a < b) a = b;
  return a;
}
int &madd(int &a, int b) {
  a += b;
  if (a >= 1000000009) a -= 1000000009;
  return a;
}
int &msub(int &a, int b) {
  a -= b;
  if (a < 0) a += 1000000009;
  return a;
}
int &mmult(int &a, int b) { return a = (long long)a * b % 1000000009; }
int mdiv(long long a, long long b, long long m) {
  a = (a % m + m) % m;
  b = (b % m + m) % m;
  if (a % b == 0) return a / b;
  return (a + m * mdiv(-a, m, b)) / b;
}
int DX[16] = {0, 0, 0, 0, 1, 2, 3, 2, 1, 1, 1, 3, 2, 2, 3, 3};
int DY[16] = {0, 1, 2, 3, 0, 0, 0, 1, 2, 1, 3, 1, 2, 3, 2, 3};
struct pos {
  int A[4][4];
  bool B[4 * 4];
  int l;
  pos() {
    int i, j;
    l = 0;
    for (i = (0); i < (4); ++i)
      for (j = (0); j < (4); ++j) A[i][j] = 1012345678;
    for (i = (0); i < (4 * 4); ++i) B[i] = 0;
  }
  bool operator<(const pos &p) const {
    int i, j;
    for (i = (0); i < (4); ++i)
      for (j = (0); j < (4); ++j)
        if (A[i][j] != p.A[i][j]) return A[i][j] < p.A[i][j];
    return 0;
  }
};
int n, m, s;
int A[4 * 4];
map<pos, pos *> D;
pos *fnd(pos p) {
  pos p0 = p;
  if (D.count(p)) {
    return D[p];
  }
  if (p.l == n * n) return D[p] = new pos(p);
  pos *res = NULL;
  D[p] = NULL;
  int i = p.l / n;
  int j = p.l % n;
  if (n == 4) {
    i = DX[p.l];
    j = DY[p.l];
  }
  int k;
  ++p.l;
  int a = 0;
  if (i == n - 1) {
    for (k = (0); k < (n - 1); ++k) a += p.A[k][j];
    a = s - a;
    int b = a;
    if (j == 0 && n != 4) {
      a = 0;
      for (k = (0); k < (n - 1); ++k) a += p.A[k][n - k - 1];
      a = s - a;
      if (b != a) return res;
    }
    if (j == n - 1) {
      a = 0;
      for (k = (0); k < (n - 1); ++k) a += p.A[k][k];
      a = s - a;
      if (b != a) return res;
    }
    p.A[i][j] = a;
    for (k = (0); k < (n * n); ++k)
      if (A[k] == a && !p.B[k]) {
        p.B[k] = 1;
        res = fnd(p);
        break;
      }
  } else if (j == n - 1) {
    for (k = (0); k < (n - 1); ++k) a += p.A[i][k];
    a = s - a;
    p.A[i][j] = a;
    for (k = (0); k < (n * n); ++k)
      if (A[k] == a && !p.B[k]) {
        p.B[k] = 1;
        res = fnd(p);
        break;
      }
  } else if (n == 4 && i == 1 && j == 2) {
    a = s - p.A[0][3] - p.A[2][1] - p.A[3][0];
    p.A[i][j] = a;
    for (k = (0); k < (n * n); ++k)
      if (A[k] == a && !p.B[k]) {
        p.B[k] = 1;
        res = fnd(p);
        break;
      }
  } else {
    for (k = (0); k < (n * n); ++k)
      if (!p.B[k]) {
        p.A[i][j] = A[k];
        p.B[k] = 1;
        res = fnd(p);
        if (res != NULL) break;
        p.B[k] = 0;
      }
  }
  return D[p0] = res;
}
int main() {
  int i, j, k;
  char c;
  int a, d;
  int ts;
  for (ts = 1; scanf("%"
                     "d",
                     &(n)) > 0;
       ++ts) {
    s = 0;
    for (i = (0); i < (n * n); ++i)
      scanf(
          "%"
          "d",
          &(A[i])),
          s += A[i];
    s /= n;
    D.clear();
    pos res = *fnd(pos());
    printf(
        "%"
        "d",
        (s));
    printf("\n"), firstout = 1;
    for (i = (0); i < (n); ++i) {
      for (j = (0); j < (n); ++j)
        printf((firstout) ? "%"
                            "d"
                          : " %"
                            "d",
               (res.A[i][j])),
            firstout = 0;
      printf("\n"), firstout = 1;
    }
  }
  return 0;
}
