#include <bits/stdc++.h>
using namespace std;
int n, a[20], vis[20], b[20];
void dfs(int x, int k) {
	/*
	printf("%d\n", k);
	for (int i = 1; i <= n; ++i, puts(""))
		for (int j = 1; j <= n; ++j)
			printf("%d ", b[(i - 1) * n + j]);
	puts("------------------");
	*/
	int flag = 0;
	if (x > n) {
		for (int i = x; i > x - n; --i)
			flag += b[i];
		if (flag > k) return ;
		flag = 0;
		if (x % n == 0) {
			for (int i = x; i > x - n; --i)
				flag += b[i];
			if (flag != k)
				return ;
			flag = 0;
		}
		if (x > n * n - n) {
			for (int i = x; i >= 1; x -= n)
				flag += b[i];
			if (flag != k)
				return ;
			flag = 0;
		}
		if (x == n * n) {
			for (int i = 1; i <= n * n; i += n + 1)
				flag += b[i];
			if (flag != k)
				return ;
			flag = 0;
		}
		if (x == n * n - n + 1) {
			for (int i = n; i <= n * n - n + 1; i += n - 1)
				flag += b[i];
			if (flag != k)
				return ;
			flag = 0;
		}
	}
	if (x == n * n) {
		printf("%d\n", k);
		for (int i = 1; i <= n; ++i, puts(""))
			for (int j = 1; j <= n; ++j)
				printf("%d ", b[(i - 1) * n + j]);
		exit(0);
	}
	if (x == n)
		for (int i = 1; i <= n; ++i)
			k += b[i];
	for (int i = 1; i <= n * n; ++i)
		if (!vis[i]) {
			vis[i] = 1;
			b[x + 1] = a[i];
			dfs(x + 1, k);
			vis[i] = 0;
		}
}
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n * n; ++i) scanf("%d", &a[i]);
	sort(a + 1, a + n * n + 1);
	dfs(0, 0);
	return 0;
}