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;

public class Main {
	public static void main(String[] args) {
		final Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		boolean isAllPlus = true;
		boolean isAllMinus = true;
		for (int i = 0; i < n; i++) {
			arr[i] = sc.nextInt();
			if (arr[i] < 0) {
				isAllPlus = false;
			}
			if (arr[i] > 0) {
				isAllMinus = false;
			}
		}
		int count = 0;
		StringBuilder sb = new StringBuilder();
		if (isAllPlus) {
			for (int i = 0; i < n - 1; i++) {
				if (arr[i] > arr[i + 1]) {
					sb.append(i + 1 + " " + (i + 2) + "\n");
					arr[i + 1] += arr[i];
					count++;
				}
			}
			System.out.println(count);
			System.out.println(sb.toString());
			return;
		}
		if (isAllMinus) {
			for (int i = n - 1; i > 0; i--) {
				if (arr[i] < arr[i - 1]) {
					arr[i - 1] += arr[i];
					sb.append(i + 1 + " " + (i) + "\n");
					count++;
				}
			}
			System.out.println(count);
			System.out.println(sb.toString());
			return;
		}
		int maxIndex = 0;
		int maxAbs = 0;
		for (int i = 0; i < n; i++) {
			if (Math.abs(arr[i]) > maxAbs) {
				maxIndex = i;
				maxAbs = Math.abs(arr[i]);
			}
		}
		if (arr[maxIndex] > 0) {
			for (int i = 0; i < n; i++) {
				if (arr[i] < 0) {
					arr[i] += arr[maxIndex];
					sb.append(maxIndex + 1 + " " + (i + 1) + "\n");
					count++;
				}
			}
			for (int i = 0; i < n - 1; i++) {
				if (arr[i] > arr[i + 1]) {
					arr[i + 1] += arr[i];
					sb.append(i + 1 + " " + (i + 2) + "\n");
					count++;
				}
			}
			System.out.println(count);
			System.out.println(sb.toString());
			return;

		} else {
			for (int i = 0; i < n; i++) {
				if (arr[i] > 0) {
					arr[i] += arr[maxIndex];
					sb.append(maxIndex + 1 + " " + (i + 1) + "\n");
					count++;
				}
			}
			for (int i = n - 1; i > 0; i--) {
				if (arr[i] < arr[i - 1]) {
					arr[i - 1] += arr[i];
					sb.append(i + 1 + " " + (i) + "\n");
					count++;
				}
			}
			System.out.println(count);
			System.out.println(sb.toString());
			return;
		}
	}
}