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
// package other2018.kupc2018;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    static long __startTime = System.currentTimeMillis();

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();

        long[][] a = new long[n][2];
        for (int i = 0; i < n ; i++) {
            a[i][0] = in.nextLong();
            a[i][1] = i;
        }
        Arrays.sort(a, (u, v) -> Long.compare(v[0], u[0]));

        Map<Long,Integer> vmap = new HashMap<>();
        for (int i = 0; i < n ; i++) {
            vmap.put(a[i][0], (int)a[i][1]);
        }

        child = new int[n];
        Arrays.fill(child, 1);
        List<int[]> edges = new ArrayList<>();

        graph = new List[n];
        for (int i = 0; i < n ; i++) {
            graph[i] = new ArrayList<>();
        }

        for (int i = 0; i < n ; i++) {
            long v = a[i][0];
            int idx = (int)a[i][1];
            long pl = child[idx];
            long pv = v + pl - (n - pl);
            if (!vmap.containsKey(pv) || v < pv) {
                continue;
            }
            int pidx = vmap.get(pv);
            edges.add(new int[]{idx, pidx});
            graph[pidx].add(idx);
            child[pidx] += child[idx];
        }

        boolean valid = true;
        visited = new boolean[n];
        valid &= dfs((int)a[n-1][1]);
        for (int i = 0; i < n ; i++) {
            valid &= visited[i];
        }
        if (valid) {
            valid &= dfs2((int) a[n - 1][1]) == a[n - 1][0];
        }

        if (valid) {
            for (int[] e : edges) {
                out.println(String.format("%d %d", e[0]+1, e[1]+1));
            }
        } else {
            out.println(-1);
        }
        out.flush();
    }

    static boolean[] visited;
    static List<Integer>[] graph;
    static int[] child;

    static long dfs2(int r) {
        long total = 0;
        for (int to : graph[r]) {
            total += dfs2(to) + child[to];
        }
        return total;
    }

    static boolean dfs(int r) {
        if (visited[r]) {
            return false;
        }
        visited[r] = true;
        boolean ok = true;
        for (int to : graph[r]) {
            ok &= dfs(to);
        }
        return ok;
    }

    private static void printTime(String label) {
        debug(label, System.currentTimeMillis() - __startTime);
    }

    private static void debug(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }

    public static class InputReader {
        private static final int BUFFER_LENGTH = 1 << 12;
        private InputStream stream;
        private byte[] buf = new byte[BUFFER_LENGTH];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        private int next() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public char nextChar() {
            return (char) skipWhileSpace();
        }

        public String nextToken() {
            int c = skipWhileSpace();
            StringBuilder res = new StringBuilder();
            do {
                res.append((char) c);
                c = next();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public int nextInt() {
            return (int) nextLong();
        }

        public long nextLong() {
            int c = skipWhileSpace();
            long sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            return Double.valueOf(nextToken());
        }

        int skipWhileSpace() {
            int c = next();
            while (isSpaceChar(c)) {
                c = next();
            }
            return c;
        }

        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    }
}