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
#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(i=0;i<(n);i++)
#define For(i,a,b) for(i=(a);i<(b);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const double PI=acos(-1.0);
#define inf 10000000

int main(){
	int i,j,k;
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i,n) cin >> a[i];
	int min=inf,max=-1*inf;
	rep(i,n){
		if(min>a[i]){
			min=a[i];
			j=i;
		}
		if(max<a[i]){
			max=a[i];
			k=i;
		}
	}
	if(min==max){
	  cout << 0 << endl;
	  return 0;
	}
	cout << 2*n-1 << endl;
	j++;
	k++;
	if(abs(max)>=abs(min)){
		rep(i,n) cout << k << " " << i+1 << endl;
		For(i,1,n) cout << i << " " << i+1 << endl;
	}else{
		rep(i,n) cout << j << " " << i+1 << endl;
		for(i=n;i>1;i--){
			cout << i << " " << i-1 << endl;
		}
	}

	return 0;
}