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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace AtCoder
{
    class Program
    {
        private static string Read() { return Console.ReadLine(); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }

        private static IEnumerable<Tuple<int, int>> SolveNegatively(int N, int[] a)
        {
            var list = new List<Tuple<int, int>>();
            for (int i = N - 1; i > 0; --i)
            {
                if (a[i - 1] > a[i]) { list.Add(new Tuple<int, int>(i, i - 1)); }
            }
            return list;
        }

        private static IEnumerable<Tuple<int, int>> SolvePositively(int N, int[] a)
        {
            var list = new List<Tuple<int, int>>();
            for (int i = 0; i < N - 1; ++i)
            {
                if (a[i] > a[i + 1]) { list.Add(new Tuple<int, int>(i, i + 1)); }
            }
            return list;
        }

        private static IEnumerable<Tuple<int, int>> Solve(int N, int[] a)
        {
            int min = int.MaxValue;
            int max = int.MinValue;
            int mini = 0;
            int maxi = 0;
            for (int i = 0; i < N; ++i)
            {
                if (a[i] < min)
                {
                    min = a[i];
                    mini = i;
                }
                if (a[i] > max)
                {
                    max = a[i];
                    maxi = i;
                }
            }
            if (max <= 0)
            {
                return SolveNegatively(N, a);
            }
            else if (min >= 0)
            {
                return SolvePositively(N, a);
            }
            else
            {
                var list = new List<Tuple<int, int>>();
                if (Math.Abs(min) > Math.Abs(max))
                {
                    for (int i = 0; i < N; ++i)
                    {
                        if (a[i] > 0)
                        {
                            a[i] += min;
                            list.Add(new Tuple<int, int>(mini, i));
                        }
                    }
                    return Enumerable.Union(list, SolveNegatively(N, a));
                }
                else
                {
                    for (int i = 0; i < N; ++i)
                    {
                        if (a[i] < 0)
                        {
                            a[i] += max;
                            list.Add(new Tuple<int, int>(maxi, i));
                        }
                    }
                    return Enumerable.Union(list, SolvePositively(N, a));
                }
            }
        }

        static void Main(string[] args)
        {
            int N = ReadInt();
            int[] a = ReadInts();
            var tuples = Solve(N, a);
            Console.WriteLine(tuples.Count());
            foreach (var tuple in tuples)
            {
                Console.WriteLine("{0} {1}", tuple.Item1 + 1, tuple.Item2 + 1);
            }
        }
    }
}