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.*;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	static class Tuple {
		int a, b;

		Tuple(int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public String toString() {
			return (a + 1) + " " + (b + 1);
		}
	}

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		String[] tokens = in.readLine().split(" ");
		int N = Integer.parseInt(tokens[0]);
		long[] a = new long[N];
		tokens = in.readLine().split(" ");
		for (int i = 0; i < N; ++i) {
			a[i] = Long.parseLong(tokens[i]);
		}
		long min = Long.MAX_VALUE, max = Long.MIN_VALUE;
		int minIndex = -1, maxIndex = -1;
		for (int i = 0; i < N; ++i) {
			if (min > a[i]) {
				min = a[i];
				minIndex = i;
			}
			if (max < a[i]) {
				max = a[i];
				maxIndex = i;
			}
		}
		List<Tuple> result = new ArrayList<>();
		if (Math.abs(min) > Math.abs(max)) {
			// 全体にminを足す
			for (int i = 0; i < N; ++i) {
				if (i == minIndex) {
					continue;
				}
				a[i] += min;
				result.add(new Tuple(minIndex, i));
			}
			// 後ろから順に足していく
			for (int i = N - 1; i > 0; --i) {
				result.add(new Tuple(i, i - 1));
				a[i - 1] += a[i];
			}
		} else {
			// 全体にmaxを足す
			for (int i = 0; i < N; ++i) {
				if (i == maxIndex) {
					continue;
				}
				a[i] += max;
				result.add(new Tuple(maxIndex, i));
			}
			// 前から順に足していく
			for (int i = 0; i + 1 < N; ++i) {
				result.add(new Tuple(i, i + 1));
				a[i + 1] += a[i];
			}
		}
		// 回答出力
		System.out.println(result.size());
		for (int i = 0; i < result.size(); ++i) {
			System.out.println(result.get(i).toString());
		}
	}
}