//CRUNCH UP THE NUMBERS!!!
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
#include<map>
#include<unordered_set>
#include<cstdlib>
#include<climits>
#include<sstream>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<cmath>
#include<cstdio>
#include <iomanip>
#include <functional>
#include <utility>
#include <numeric>
#include <cmath>
#include <set>

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define F first
#define S second
#define mp make_pair
#define ll long long
#define M 100001
using namespace std;
int mod = 1e9+7;
typedef unsigned long long ull;
typedef pair <int, int> pii;
 
template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
 
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
 
template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}
void accell() {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
}
const int  N = 501;


void solve(){
  int n;
  cin>>n;
  int a[N][N];
  memset(a,-1,sizeof(a));
  int tar = 0,freq = 0;
  bool woo=1;
  for(int i=0;i<n;i++){
    cin>>a[i][i];
    if(a[i][i]>n)woo=0;
    if(i==0){tar = a[i][i];freq =tar;
    }
  }
  if(!woo) {cout<<-1<<endl;return;}
  for(int i=0;i<n;i++){
    if(freq==0)break;
    a[i][0] = tar;
    freq--;
  }
  
  for(int i=1;i<n;i++){
    int val = a[i][i];
    int frq = val-1;
    int j = i,k = i;
      if(frq==0)continue;
    while(1){
      if(a[k][j-1]==-1&&j-1>=0){
        a[k][j-1] = val;
        j--;
        frq--;
        if(frq==0)break;
      }else if(a[k+1][j]==-1){
          a[k+1][j] = val;
          frq--;
          k++;
          if(frq==0)break;
      }else {cout<<-1<<endl;return;}
    }
  }
  
  
  
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
    if(a[i][j]==-1){
      cout<<" ";
    }else
    cout<<a[i][j]<<" ";
    }
    cout<<endl;
  }
  
  
 
}
int main(){
   accell();
  int t=1;
  
  while(t--){
        solve();
  }
}


