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.List;
import java.util.Scanner;

public class Main implements Runnable {

    public static void main(String[] args) {
        new Thread(null, new Main(), "", 128 * 1024 * 1024).start();
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N + 1];
        boolean allNegative = true, allPositive = true;
        int maxIdx = 1;
        boolean isMaxPositive = false;
        boolean isSorted = true;
        for (int i = 1; i <= N; i++) {
            a[i] = sc.nextInt();
            if (a[i] > 0) {
                allNegative = false;
            }
            if (a[i] < 0) {
                allPositive = false;
            }
            if (Math.abs(a[i]) >= Math.abs(a[maxIdx])) {
                isMaxPositive = a[i] > 0;
                maxIdx = i;
            }
            if (i != 1 && a[i - 1] > a[i]) {
                isSorted = false;
            }
        }

        List<Pair> pairs = new ArrayList<>();
        if (!allNegative && !allPositive) {
            for (int i = 1; i <= N; i++) {
                pairs.add(new Pair(maxIdx, i));
                a[i] += a[maxIdx];
            }
        }

        if (!isSorted) {
            if (isMaxPositive) {
                for (int i = 1; i <= N - 1; i++) {
                    pairs.add(new Pair(i, i + 1));
                    a[i + 1] += a[i];
                }
            } else {
                for (int i = N; i >= 1 + 1; i--) {
                    pairs.add(new Pair(i, i - 1));
                    a[i - 1] += a[i];
                }
            }
        }

        System.out.println(pairs.size());
        for (int i = 0; i < pairs.size(); i++) {
            System.out.println(pairs.get(i).x + " " + pairs.get(i).y);
        }
    }

    class Pair {

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        int x;
        int y;
    }
}