Problem:
Score : 600 points

Problem Statement

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.

Sample Input 1

3
-2 5 -1

Sample Output 1

2
2 3
3 3

After the first operation, a = (-2,5,4).

After the second operation, a = (-2,5,8), and the condition is now satisfied.

Sample Input 2

2
-1 -3

Sample Output 2

1
2 1

After the first operation, a = (-4,-3) and the condition is now satisfied.

Sample Input 3

5
0 0 0 0 0

Sample Output 3

0

The condition is satisfied already in the beginning.

Solution in Ruby (2.3.3) (judge verdict: Accepted)

N = gets.chomp.to_i
A = gets.chomp.split(' ').map(&:to_i)

ans = []

maxi = 0
mini = 0
max = A[maxi]
min = A[mini]

(1..(N-1)).each do |i|
    if A[i] > max
        max = A[i]
        maxi = i
    end

    if A[i] < min
        min = A[i]
        mini = i
    end
end

basei = maxi
base = max

if min >= 0
    base = max
    basei = maxi

    (0..(N-2)).each do |i|
        ans << [i, i + 1]
    end
elsif max < 0
    base = min
    basei = mini

    (0..(N-2)).each do |i|
        ans << [N-1 - i, N-2 - i]
    end
elsif max.abs >= min.abs
    base = max
    basei = maxi

    (0..(N-1)).each do |i|
        ans << [basei , i] unless i == basei
    end
    (0..(N-2)).each do |i|
        ans << [i, i + 1]
    end
else
    base = min
    basei = mini

    (0..(N-1)).each do |i|
        ans << [basei , i] unless i == basei
    end
    (0..(N-2)).each do |i|
        ans << [N-1 - i, N-2 - i]
    end
end



# newa = A.map.with_index do |a, i|
#     if i == basei
#         a
#     else
#         ans << [basei, i]
#         a + base
#     end
# end

# (0..(N-2)).each do |i|
#     if newa[i] > newa[i+1]
#         if base >= 0
#             ans << [i, i+1]
#         else
#             ans << [i+1, i]
#         end
#     end
# end

puts ans.length
ans.each do |a|
    puts "#{a[0] + 1} #{a[1] + 1}"
end