You are given a sequence D_1, D_2, ..., D_N of length N. The values of D_i are all distinct. Does a tree with N vertices that satisfies the following conditions exist?

* The vertices are numbered 1,2,..., N.
* The edges are numbered 1,2,..., N-1, and Edge i connects Vertex u_i and v_i.
* For each vertex i, the sum of the distances from i to the other vertices is D_i, assuming that the length of each edge is 1.



If such a tree exists, construct one such tree.

Constraints

* 2 \leq N \leq 100000
* 1 \leq D_i \leq 10^{12}
* D_i are all distinct.

Input

Input is given from Standard Input in the following format:


N
D_1
D_2
:
D_N


Output

If a tree with n vertices that satisfies the conditions does not exist, print `-1`.

If a tree with n vertices that satisfies the conditions exist, print n-1 lines. The i-th line should contain u_i and v_i with a space in between. If there are multiple trees that satisfy the conditions, any such tree will be accepted.

Examples

Input

7
10
15
13
18
11
14
19


Output

1 2
1 3
1 5
3 4
5 6
6 7


Input

2
1
2


Output

-1


Input

15
57
62
47
45
42
74
90
75
54
50
66
63
77
87
51


Output

1 10
1 11
2 8
2 15
3 5
3 9
4 5
4 10
5 15
6 12
6 14
7 13
9 12
11 13
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<algorithm>
#define N 100005
using namespace std;
struct with {
	int w;
	long long d;
} dt[N];
map<long long, int> chk;
int n;
int parent[N],subn[N];
long long d[N];
long long sum[N];
bool cmp(with i, with j) {
	return i.d < j.d;
}
int main() {
	scanf("%d", &n);
	int i;
	for (i = 1; i <= n; i++) {
		scanf("%lld", &d[i]);
		dt[i].d = d[i]; dt[i].w = i;
		subn[i] = 1;
	}
	sort(dt + 1, dt + 1 + n, cmp);
	sort(d + 1, d + 1 + n);
	for (i = 1; i <= n; i++) chk[d[i]] = i;
	bool imp = false;
	for (i = n ; i >= 2; i--) {
		int adjacent=0;
		adjacent = chk[d[i] - n + 2 * subn[i]];
		parent[i] = adjacent;
		subn[adjacent]+=subn[i];
		if (parent[i] == 0 || parent[i]==i) {
			imp = true; break;
		}
	}
	for (i = n; i >= 2; i--) {
		int up = parent[i];
		sum[up] += sum[i] + subn[i];
	}
	if (sum[1] != d[1]) imp = true;
	if (imp) printf("-1");
	else {
		for (i = 2; i <= n; i++) {
			printf("%d %d\n", dt[parent[i]].w,dt[i].w);
		}
	}
	return 0;
}