Problem: Polycarp studies at the university in the group which consists of n students (including himself). All they are registrated in the social net "TheContacnt!".

Not all students are equally sociable. About each student you know the value ai — the maximum number of messages which the i-th student is agree to send per day. The student can't send messages to himself. 

In early morning Polycarp knew important news that the programming credit will be tomorrow. For this reason it is necessary to urgently inform all groupmates about this news using private messages. 

Your task is to make a plan of using private messages, so that:

  * the student i sends no more than ai messages (for all i from 1 to n); 
  * all students knew the news about the credit (initially only Polycarp knew it); 
  * the student can inform the other student only if he knows it himself. 



Let's consider that all students are numerated by distinct numbers from 1 to n, and Polycarp always has the number 1.

In that task you shouldn't minimize the number of messages, the moment of time, when all knew about credit or some other parameters. Find any way how to use private messages which satisfies requirements above. 

Input

The first line contains the positive integer n (2 ≤ n ≤ 100) — the number of students. 

The second line contains the sequence a1, a2, ..., an (0 ≤ ai ≤ 100), where ai equals to the maximum number of messages which can the i-th student agree to send. Consider that Polycarp always has the number 1.

Output

Print -1 to the first line if it is impossible to inform all students about credit. 

Otherwise, in the first line print the integer k — the number of messages which will be sent. In each of the next k lines print two distinct integers f and t, meaning that the student number f sent the message with news to the student number t. All messages should be printed in chronological order. It means that the student, who is sending the message, must already know this news. It is assumed that students can receive repeated messages with news of the credit. 

If there are several answers, it is acceptable to print any of them. 

Examples

Input

4
1 2 1 0


Output

3
1 2
2 4
2 3


Input

6
2 0 1 3 2 0


Output

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


Input

3
0 2 2


Output

-1

Note

In the first test Polycarp (the student number 1) can send the message to the student number 2, who after that can send the message to students number 3 and 4. Thus, all students knew about the credit. 

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class TaskB {
    InputReader in = new InputReader(System.in);
    PrintWriter out = new PrintWriter(System.out);
    ArrayList<Pair> ar;
 	ArrayList<Integer> ans = new ArrayList<>();
    int k = 0;
    int max;
    
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
    }
    public void dfs(int max, int index) {
    	if(ar.size() == 0) {
			return;
		}

    		for(int i = 0; i < max; i++) {
    			if(ar.size() == 0) {
        			return;
        		}
    	    	int ind = ar.get(ar.size()-1).getIndex();
    	    	ans.add(index+1);
    	    	ans.add(ind+1);
    	    	k++;
    	    	int m = ar.get(ar.size()-1).getMax();
    	    	ar.remove(ar.size()-1);
    	    	dfs(m , ind);
    	    	}

    }
    public void run() {
    	int n = in.nextInt();
    	ar = new ArrayList<>(n-1);
    	max = in.nextInt();
    	for(int i = 1; i < n; i++) {
    		Pair p = new Pair();
    		p.setIndex(i);
    		p.setMax(in.nextInt());
    		ar.add(p);
    	}
    	Collections.sort(ar);
    	dfs(max,0 );
    	if(ar.size() == 0) {
    		out.println(k);
    		for(int i = 0; i < k*2; i+=2) {
    			out.println(ans.get(i) + " " + ans.get(i+1));
    		}
    	}
    	else {
    		out.println(-1);
    	}
    	out.close();
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		TaskB b = new TaskB();
		b.run();
	}

}

class Pair implements Comparable {
	public int getMax() {
		return max;
	}

	public void setMax(int max) {
		this.max = max;
	}

	public int getIndex() {
		return index;
	}

	public void setIndex(int index) {
		this.index = index;
	}

	int max, index;

	@Override
	public int compareTo(Object o) {
		// TODO Auto-generated method stub
		Pair p = (Pair)o;
		if(max == p.getMax())  {
			return 0;
		}
		if(max > p.getMax()) {
			return 1;
		}
		else {
			return -1;
		}
	}
}