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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<set>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#define Max zhi5968
typedef long long ll;
using namespace std;

int a[200000+50];
 
int main ()
{
	int a[100]={0},mn=9999999,mxi,mni,mx=-99999999,i,n,ans;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>a[i];
		if(a[i]>mx)
		{
			mx=a[i];
			mxi=i;
		}
		if(a[i]<mn)
		{
			mn=a[i];
			mni=i;
		}
	}
//	cout<<mn<<" "<<mni<<" "<<mx<<" "<<mxi<<endl;
	if(mx+mn>0)
	{
		cout<<2*n-2<<endl;
		for(i=1;i<=n;i++)
			if(i!=mxi)
				printf("%d %d\n",mxi,i);
		for(i=1;i<n;i++)
			printf("%d %d\n",i,i+1);
	}
	else
	{
		cout<<2*n-1<<endl;
		for(i=1;i<=n;i++)
			if(i!=mni)
				printf("%d %d\n",mni,i);
		for(i=n;i>1;i--)
			printf("%d %d\n",i,i-1);
	}
	return 0;
}