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 {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    int N = scanner.nextInt();
    int[] a = new int[N];
    int max = -1_000_001;
    int min = 1_000_001;
    int maxi = -1;
    int mini = -1;
    for (int i = 0; i < N; i++) {
      a[i] = scanner.nextInt();
      if (a[i] > max) {
        max = a[i];
        maxi = i;
      }
      if (a[i] < min) {
        min = a[i];
        mini = i;
      }
    }

    List<int[]> operations = new ArrayList<>();
    boolean ltr;
    if (max >= 0 && min >= 0) ltr = true;
    else if (max < 0 && min < 0) ltr = false;
    else {
      if (max + min >= 0) {
        ltr = true;
        for (int i = 0; i < N; i++) {
          operations.add(new int[]{maxi, i});
          a[i] += max;
        }
      } else {
        ltr = false;
        for (int i = 0; i < N; i++) {
          operations.add(new int[]{mini, i});
          a[i] += min;
        }
      }
    }

    if (ltr) {
      for (int i = 0; i < N - 1; i++) {
        operations.add(new int[]{i, i + 1});
        a[i + 1] += a[i];
      }
    } else {
      for (int i = N - 1; i > 0; i--) {
        operations.add(new int[]{i, i - 1});
        a[i - 1] += a[i];
      }
    }

    System.out.println(operations.size());
    for (int[] p : operations) System.out.printf("%d %d\n", p[0] + 1, p[1] + 1);
  }
}
