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.util.Scanner;
import java.util.Arrays;
import java.lang.Math;

public class Main {
	int[] a;
	int n;

	public boolean isNonNegativeInteger() {
		for(int i = 0; i < n; i++) {
			if(a[i] <= 0) {
				return false;
			}
		}
		return true;
	}

	public boolean isNegativeInteger() {
		for(int i = 0; i < n; i++) {
			if(a[i] > 0) {
				return false;
			}
		}
		return true;
	}

	public int max() {
		int max = Integer.MIN_VALUE / 2;
		int index = -1;
		for(int i = 0; i < n; i++) {
			if(max < a[i]) {
				max = a[i];
				index = i;
			}
		}
		return index;
	}

	public int min() {
		int min = Integer.MAX_VALUE / 2;
		int index = -1;
		for(int i = 0; i < n; i++) {
			if(a[i] < min) {
				min = a[i];
				index = i;
			}
		}
		return index;
	}

	public void run() {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		a = new int[n];
		for(int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}

		if(isNonNegativeInteger()) {
			System.out.println(n - 1);
			for(int i = 0; i < n - 1; i++) {
				System.out.println((i + 1) + " " + (i + 2));
				a[i + 1] += a[i];
			}
		}
		else if(isNegativeInteger()) {
			System.out.println(n - 1);
			for(int i = n - 2; i >= 0; i--) {
				System.out.println((i + 2) + " " + (i + 1));
				a[i] += a[i + 1];
			}
		}
		else {
			System.out.println(n + (n - 1));
			int max = max();
			int min = min();
			if(Math.abs(a[max]) >= Math.abs(a[min])) {
				int maxv = a[max];
				for(int i = 0; i < n; i++) {
					System.out.println((max + 1) + " " + (i + 1));
					a[i] += maxv;
				}
				for(int i = 0; i < n - 1; i++) {
					System.out.println((i + 1) + " " + (i + 2));
					a[i + 1] += a[i];
				}
			}
			else {
				int minv = a[min];
				for(int i = 0; i < n; i++) {
					System.out.println((min + 1) + " " + (i + 1));
					a[i] += minv;
				}
				for(int i = n - 2; i >= 0; i--) {
					System.out.println((i + 2) + " " + (i + 1));
					a[i] += a[i + 1];
				}
			}
		}

		// System.out.println(Arrays.toString(a));
	}

	public static void main(String[] args) {
		new Main().run();
	}
}
