Problem: 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

Solution (in JAVA):

Solution:

import java.util.Arrays;
import java.util.TreeSet;

public class Main {
  private static void solve() {
    int n = ni();
    long[][] d = new long[n][2];
    for (int i = 0; i < n; i++) {
      d[i][0] = i;
      d[i][1] = nl();
    }
    Arrays.sort(d, (o1, o2) -> Long.signum(o1[1] - o2[1]));
    TreeSet<long[]> map = new TreeSet<>((o1, o2) -> {
      if (o1[1] == o2[1]) {
        return Long.compare(o1[0], o2[0]);
      } else {
        return Long.compare(o1[1], o2[1]);
      }
    });
    for (int i = 0; i < n; i++) {
      map.add(d[i]);
    }

    long[] x = new long[n];
    long[] y = new long[n];
    Arrays.fill(x, 1);

    long[][] e = new long[n - 1][2];
    int ptr = 0;
    for (int i = n - 1; i > 0; i --) {
      long[] v = d[i];
      map.remove(v);
      long val = v[1] + 2 * x[(int)v[0]] - n;
      long[] u = map.ceiling(new long[] {-1, val});
      if (u != null && u[1] == val) {
        e[ptr++] = new long[] {v[0] + 1, u[0] + 1};
        x[(int)u[0]] += x[(int)v[0]];
        y[(int)u[0]] += x[(int)v[0]] + y[(int)v[0]];
      } else {
        out.println(-1);
        return;
      }
    }
    
    if (y[(int)d[0][0]] != d[0][1]) {
      out.println(-1);
      return;
    }

    for (long[] v : e) {
      out.println(v[0] + " " + v[1]);
    }
  }
  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}