Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.

He can perform the following operation any number of times:

* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.



He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.

* Condition: a_1 \leq a_2 \leq ... \leq a_{N}

Constraints

* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N
a_1 a_2 ... a_{N}


Output

Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.

Examples

Input

3
-2 5 -1


Output

2
2 3
3 3


Input

2
-1 -3


Output

1
2 1


Input

5
0 0 0 0 0


Output

0
import java.io.File;
import java.io.IOException;
import java.util.*;
import java.util.Map.Entry;

import javax.swing.plaf.synth.SynthSeparatorUI;

public class Main{
	
	public static void main(String[] args) throws IOException{
		//File file = new File("input.txt");
		//Scanner in = new Scanner(file);
		
		Scanner in = new Scanner(System.in);
		
		int N = in.nextInt();
		int[] a = new int[N];
		int max = -1000001, indexMax = -1;
		int min = 1000001, indexMin = -1;
		for(int i = 0; i < N; i++){
			a[i] = in.nextInt();
			if(a[i] < min){
				min = a[i];
				indexMin = i;
			}
			if(a[i] > max){
				max = a[i];
				indexMax = i;
			}
		}
		
		int diff = 0;
		int indexDiff = -1;
		if(Math.abs(min) > Math.abs(max)){
			diff = min;
			indexDiff = indexMin;
		}else{
			diff = max;
			indexDiff = indexMax;
		}
		
		System.out.println(2 * N - 1);
		
		/*
		for(int i = 0; i < N; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();
		*/
		
		for(int i = 0; i < N; i++){
			a[i] += a[indexDiff];
			System.out.println((indexDiff+1) + " " + (i+1));
		}
		
		/*
		for(int i = 0; i < N; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();
		*/
		
		if(diff >= 0){
			for(int i = 1; i < N; i++){
				//if(a[i] < a[i-1]) a[i] += a[i-1];
				a[i] += a[i-1];
				System.out.println((i-1+1) + " " + (i+1));
			}
		}else{
			for(int i = N - 2; i >= 0; i--){
				//if(a[i] < a[i-1]) a[i] += a[i-1];
				a[i] += a[i+1];
				System.out.println((i+1+1) + " " + (i+1));
			}
		}
		
		/*
		for(int i = 0; i < N; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();
		*/
		
	}
}
