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 <algorithm>
#include <queue>
#include <map> 
#include <cstring>
using namespace std;
#define LL long long
const int N = 100010;
LL d[N];
queue<int>q;
int n;
int dist[N],sz[N];
map<LL,int>mp;
vector<int>g[N];
pair<int,int> edge[N];
int main(){
	scanf("%d",&n);
	for(register int i = 1;i <= n;++i){
		scanf("%lld",&d[i]);
		mp[d[i]] = i;
		sz[i] = 1;
	}
	for(register int i = 1;i < n;++i){
		auto it = mp.rbegin();
		int x = it -> second;
		LL dy = d[x] - n + 2*sz[x];
		if(mp.find(dy) == mp.end() || mp[dy] == x)
			return puts("-1"),0;
		int y = mp[dy];
		edge[i] = make_pair(x,y);
		g[x].push_back(y);
		g[y].push_back(x);
		sz[y] += sz[x];
		mp.erase(--mp.end());
	}
	memset(dist,-1,sizeof(dist));
	dist[1] = 0;
	LL tot = 0;
	q.push(1);
	while(q.size()){
		int x = q.front();
		tot += dist[x];
		q.pop();
		for(auto y : g[x])
		if(dist[y] == -1){
			dist[y] = dist[x] + 1;
			q.push(y);
		}
	}
	if(tot != d[1])
		return puts("-1"),0;
	for(int i = 1;i < n;++i)
		printf("%d %d\n",edge[i].first,edge[i].second);
	return 0;
}