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.*;

public class Main {

    public static int maxa (int[] array) {
        int max_val = array[0];
        for (int i = 1; i < array.length; i++) {
            max_val = Math.max(max_val, array[i]);
        }

        return max_val;
    }

    public static int mina (int[] array) {
        int min_val = array[0];
        for (int i = 1; i < array.length; i++) {
            min_val = Math.min(min_val, array[i]);
        }

        return min_val;
    }

    public static int linearSearch (int key, int[] array) {
        int index = -1;
        for (int i = 0; i < array.length; i++) {
            if (key == array[i]) {
                index = i;
                break;
            }
        }

        return index;
    }

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

        int flag;
        if (a[0] >= 0) {
            flag = 0;
        } else {
            flag = 1;
        }
        for (int i = 1; i < a.length; i++) {
            if ((a[i] < 0 && flag == 0) || (a[i] > 0 && flag == 1)) {
                flag = 2;
                break;
            }
        }

        switch (flag) {
            case 0:
                System.out.println(n - 1);
                for (int i = 0; i < a.length - 1; i++) {
                    a[i + 1] += a[i];
                    System.out.println((i + 1) + " " + (i + 2));
                }
                break;
            case 1:
                System.out.println(n - 1);
                for (int i = a.length - 1; i > 0; i--) {
                    a[i - 1] += a[i];
                    System.out.println((i+1) + " " + i);
                }
                break;
            case 2:
                boolean add_f = true;
                int max = maxa(a);
                int min = mina(a);
                int max_index = linearSearch(max, a) + 1;
                int min_index = linearSearch(min, a) + 1;

                if (Math.abs(max) < Math.abs(min)) {
                    add_f = false;
                }

                System.out.println(2 * n - 1);

                if (add_f == true) {
                    for (int i = 0; i < a.length; i++) {
                        a[i] += max;
                        System.out.println(max_index + " " + (i + 1));
                    }
                    for (int i = 0; i < a.length - 1; i++) {
                        a[i + 1] += a[i];
                        System.out.println((i + 1) + " " + (i + 2));
                    }
                } else {
                    for (int i = 0; i < a.length; i++) {
                        a[i] += min;
                        System.out.println(min_index + " " + (i + 1));
                    }
                    for (int i = a.length - 1; i > 0; i--) {
                        a[i - 1] += a[i];
                        System.out.println((i+1) + " " + i);
                    }
                }
        }
    }
}
