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.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = stdin.nextInt();
        }

        List<Integer> x = new ArrayList<>();
        List<Integer> y = new ArrayList<>();

        if (!isPositive(a) && !isNegative(a)) {
            int max = IntStream.range(0, n).boxed().collect(Collectors.maxBy(Comparator.comparing(i -> a[i]))).get().intValue();
            int min = IntStream.range(0, n).boxed().collect(Collectors.minBy(Comparator.comparing(i -> a[i]))).get().intValue();
            if (Math.abs(a[min]) <= Math.abs(a[max])) {
                for (int i = 0; i < n; i++) {
                    x.add(max);
                    y.add(i);
                    a[i] += a[max];
                }
            } else {
                for (int i = 0; i < n; i++) {
                    x.add(min);
                    y.add(i);
                    a[i] += a[min];
                }
            }
        }

        if (isPositive(a)) {
            for (int i = 0; i < n - 1; i++) {
                x.add(i);
                y.add(i + 1);
            }
        }

        if (isNegative(a)) {
            for (int i = n - 1; i > 0; i--) {
                x.add(i);
                y.add(i - 1);
            }
        }

        System.out.println(x.size());
        for (int i = 0; i < x.size(); i++) {
            System.out.printf("%d %d%n", x.get(i) + 1, y.get(i) + 1);
        }
    }

    public static boolean isPositive(int[] a) {
        return Arrays.stream(a).allMatch(i -> i >= 0);
    }

    public static boolean isNegative(int[] a) {
        return Arrays.stream(a).allMatch(i -> i <= 0);
    }
}