//Author:xht37
#include <bits/stdc++.h>

#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double

#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair

#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)

#define vi vector <int>
#define pb push_back
#define pq priority_queue

#define dbg(x) cerr << #x" = " << (x) << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)

#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)

using namespace std;

namespace io {
	const int SI = 1 << 21 | 1;
	char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
	int f1, t;
	#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
	inline void flush() {
		fwrite(OB, 1, OS - OB, stdout), OS = OB;
	}
	inline void pc(char x) {
		*OS++ = x;
		if (OS == OT) flush();
	}

	template <class I>
	inline void rd(I &x) {
		for (f1 = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f1 = -1;
		for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
		x *= f1;
	}
	template <class I>
	inline void rd(I &x, I &y) {
		rd(x), rd(y);
	}
	template <class I>
	inline void rd(I &x, I &y, I &z) {
		rd(x), rd(y), rd(z);
	}
	template <class I>
	inline void rda(I *a, int n) {
		for (int i = 1; i <= n; i++) rd(a[i]);
	}
	inline void rdc(char &c) {
		for (c = gc(); c < 33 || c > 126; c = gc());
	}
	inline void rds(char *s, int &n) {
		for (c = gc(); c < 33 || c > 126; c = gc());
		for (n = 0; c >= 33 && c <= 126; s[++n] = c, c = gc());
	}
	inline void rds(string &s) {
		for (c = gc(); c < 33 || c > 126; c = gc());
		for (s.clear(); c >= 33 && c <= 126; s.pb(c), c = gc());
	}

	template <class I>
	inline void print(I x, char k = '\n') {
		if (!x) pc('0');
		if (x < 0) pc('-'), x = -x;
		while (x) ch[++t] = x % 10 + '0', x /= 10;
		while (t) pc(ch[t--]);
		pc(k);
	}
	template <class I>
	inline void print(I x, I y) {
		print(x, ' '), print(y);
	}
	template <class I>
	inline void print(I x, I y, I z) {
		print(x, ' '), print(y, ' '), print(z);
	}
	template <class I>
	inline void printa(I *a, int n) {
		for (int i = 1; i <= n; i++) print(a[i], " \n"[i==n]);
	}
	inline void printc(char c) {
		pc(c);
	}
	inline void prints(char *s, int n) {
		for (int i = 1; i <= n; i++) pc(s[i]);
		pc('\n');
	}
	inline void prints(string s) {
		int n = s.length();
		while (t < n) pc(s[t++]);
		pc('\n'), t = 0;
	}
	struct Flush {
		~Flush() {
			flush();
		}
	} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printa;
using io::printc;
using io::prints;

const int N = 1e3 + 7;
int n, m, s, a[N], p[N], q[N], ans[N];

void work(int k) {
	bool ok1 = 1, ok2 = 0;
	for (int i = 1; i <= k; i++) --a[p[i]];
	int mn = *min_element(a + 1, a + n + 1);
	int mx = *max_element(a + 1, a + n + 1);
	if (mn * 2 >= mx) {
		ok2 = 1;
		copy(p + 1, p + k + 1, q + 1);
		sort(q + 1, q + k + 1);
	} else if (mn * 2 + 1 == mx) {
		int k1 = 0, k2 = 0;
		static int f1[N], f2[N];
		for (int i = 1; i <= k; i++)
			((a[p[i]] == mn || a[p[i]] == mx) ? f1[++k1] : f2[++k2]) = p[i];
		sort(f1 + 1, f1 + k1 + 1, [&](int i, int j) {
			if ((a[i] == mn) == (a[j] == mn)) return i < j;
			return (a[i] == mn) < (a[j] == mn);
		});
		sort(f2 + 1, f2 + k2 + 1);
		int x1 = 1, x2 = 1;
		for (int i = 1; i <= k; i++)
			if (x1 <= k1 && x2 <= k2)
				q[i] = f1[x1] < f2[x2] ? f1[x1++] : f2[x2++];
			else q[i] = x1 <= k1 ? f1[x1++] : f2[x2++];
		ok2 = 1;
		for (int i = k + 1; i <= n; i++)
			if (a[p[i]] == mn) ok2 = 0;
		ok2 |= !x1 || (a[f1[1]] == mx);
	}
	for (int i = 1; i <= k; i++) ++a[p[i]];
	if (!ok1 || !ok2) q[1] = 0;
}

inline bool pd(int *a, int *b) {
	int p = 1;
	while (a[p] == b[p]) ++p;
	return a[p] < b[p];
}

int main() {
	rd(n), rda(a, n);
	for (int i = 1; i <= n; i++) s += a[i];
	int mn = *min_element(a + 1, a + n + 1);
	int mx = *max_element(a + 1, a + n + 1);
	if (mn * 2 < mx) return print(-1), 0;
	iota(p + 1, p + n + 1, 1), work(n);
	for (int i = 1; i <= n; i++) --a[q[i]], ans[++m] = p[i] = q[i];
	while (m != s) {
		static int t[N];
		memset(t, 0, sizeof(t)), t[1] = n + 1;
		int k = 0;
		for (int i = 1; i <= n; i++) {
			work(i);
			if (q[1] && pd(q, t))
				k = i, copy(q + 1, q + i + 1, t + 1);
		}
		for (int i = 1; i + k <= n; i++) p[i] = p[i+k];
		for (int i = 1; i <= k; i++)
			ans[++m] = p[n-k+i] = t[i], --a[t[i]];
	}
	printa(ans, m);
	return 0;
}

Measured memory_bytes: 3652