import java.util.Scanner;
import java.util.*;

public class prog {
  Scanner sc = new java.util.Scanner(System.in);
  
  private void solve() {
    int n = sc.nextInt();
    int[] v = new int[n * n];
    int[][] mat = new int[n][n];
    for (int i = 0; i < n * n; i++) v[i] = sc.nextInt();
    Arrays.sort(v);
    int pos = n * n - 1;
    for (int i = 0; i < n; i++) {
      mat[i][i] = v[pos];
      pos--;
    }
    for (int i = 0; i < n; i++, System.out.println())
      for (int j = 0; j < n; j++)
        if (i == j) System.out.print(mat[i][j] + " ");
        else System.out.print(v[pos--] + " ");
  }
  
  
  public static void main(final String[] args) {
    new prog().solve();
  }
}