Problem: 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

Solution (in PYTHON3):

Solution:
# D
n = int(input())
ali = list(map(int, input().split()))

log = []
max_ = max(ali)
min_ = min(ali)

if abs(max_) >= abs(min_):
    max_index = ali.index(max_)+1
    for i in range(n):
        log_i = i+1
        log.append((max_index, log_i))
    for j in range(n-1):
        log_j = j+1
        mae = log_j
        ushiro = log_j+1
        log.append((mae, ushiro))
elif abs(max_) < abs(min_):
    min_index = ali.index(min_) + 1
    for i in range(n):
        log_i = i + 1
        log.append((min_index, log_i))
    for j in range(1, n)[::-1]:
        log_j = j+1
        mae = log_j
        ushiro = log_j -1
        log.append((mae, ushiro))

print(len(log))
for v1, v2 in log:
    print(str(v1) + ' ' + str(v2))