Problem: Iahub is playing an uncommon game. Initially, he has n boxes, numbered 1, 2, 3, ..., n. Each box has some number of candies in it, described by a sequence a1, a2, ..., an. The number ak represents the number of candies in box k. 

The goal of the game is to move all candies into exactly two boxes. The rest of n - 2 boxes must contain zero candies. Iahub is allowed to do several (possible zero) moves. At each move he chooses two different boxes i and j, such that ai ≤ aj. Then, Iahub moves from box j to box i exactly ai candies. Obviously, when two boxes have equal number of candies, box number j becomes empty.

Your task is to give him a set of moves such as Iahub to archive the goal of the game. If Iahub can't win the game for the given configuration of boxes, output -1. Please note that in case there exist a solution, you don't need to print the solution using minimal number of moves.

Input

The first line of the input contains integer n (3 ≤ n ≤ 1000). The next line contains n non-negative integers: a1, a2, ..., an — sequence elements. It is guaranteed that sum of all numbers in sequence a is up to 106. 

Output

In case there exists no solution, output -1. Otherwise, in the first line output integer c (0 ≤ c ≤ 106), representing number of moves in your solution. Each of the next c lines should contain two integers i and j (1 ≤ i, j ≤ n, i ≠ j): integers i, j in the kth line mean that at the k-th move you will move candies from the j-th box to the i-th one.

Examples

Input

3
3 6 9


Output

2
2 3
1 3


Input

3
0 1 0


Output

-1

Input

4
0 1 1 0


Output

0

Note

For the first sample, after the first move the boxes will contain 3, 12 and 3 candies. After the second move, the boxes will contain 6, 12 and 0 candies. Now all candies are in exactly 2 boxes.

For the second sample, you can observe that the given configuration is not valid, as all candies are in a single box and they should be in two boxes. Also, any move won't change the configuration, so there exists no solution.

For the third sample, all candies are already in 2 boxes. Hence, no move is needed.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int maxn = 1005, maxk = 405;
int n, zero, anss, p1, p2, p3;
int ans[maxn * maxk][2];
struct candy {
  int v, p;
} c[maxn];
inline void chk(candy &a, candy &b) {
  candy tmp;
  if (a.v > b.v) tmp = a, a = b, b = tmp;
}
inline void move(candy &a, candy &b) {
  anss++, ans[anss][0] = a.p, ans[anss][1] = b.p;
  b.v -= a.v, a.v <<= 1;
}
void merge(candy a, candy b, candy c, candy &res1, candy &res2) {
  chk(a, b), chk(a, c), chk(b, c);
  if (a.v == 0) {
    res1 = b, res2 = c;
    return;
  }
  int k = b.v / a.v;
  while (k) {
    if (k & 1)
      move(a, b);
    else
      move(a, c);
    k >>= 1;
  }
  merge(a, b, c, res1, res2);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &c[i].v), c[i].p = i;
    zero += c[i].v == 0;
  }
  if (n - zero < 2) {
    puts("-1");
    return 0;
  }
  for (p1 = 1; p1 <= n && c[p1].v == 0; p1++)
    ;
  for (p2 = p1 + 1; p2 <= n && c[p2].v == 0; p2++)
    ;
  for (p3 = p2 + 1; p3 <= n && c[p3].v == 0; p3++)
    ;
  while (p3 <= n) {
    candy tmp1, tmp2;
    merge(c[p1], c[p2], c[p3], tmp1, tmp2);
    c[p2] = tmp1, c[p3] = tmp2;
    p1 = p2, p2 = p3;
    for (p3++; p3 <= n && c[p3].v == 0; p3++)
      ;
  }
  printf("%d\n", anss);
  for (int i = 1; i <= anss; i++) printf("%d %d\n", ans[i][0], ans[i][1]);
  return 0;
}