Codeforces 1042 C Array Product

You are given an array a consisting of n

integers. You can perform the following operations with it:

1. Choose some positions i and j (1≤i,j≤n,i≠j), write the value of ai⋅aj into the j-th cell and remove the number from the i-th cell;
2. Choose some position i and remove the number from the i-th cell (this operation can be performed no more than once and at any point of time, not necessarily in the beginning).

The number of elements decreases by one after each operation. However, the indexing of positions stays the same. Deleted numbers can't be used in the later operations.

Your task is to perform exactly n−1 operations with the array in such a way that the only number that remains in the array is maximum possible. This number can be rather large, so instead of printing it you need to print any sequence of operations which leads to this maximum number. Read the output format to understand what exactly you need to print.

Input

The first line contains a single integer n(2≤n≤2⋅10^5) — the number of elements in the array.

The second line contains n integers a1,a2,…,an (−109≤ai≤109) — the elements of the array.

Output

Print n−1 lines. The k-th line should contain one of the two possible operations.

The operation of the first type should look like this: 1 ik jk, where 1 is the type of operation, ik and jk are the positions of the chosen elements.

The operation of the second type should look like this: 2 ik, where 2 is the type of operation, ik is the position of the chosen element. Note that there should be no more than one such operation.

If there are multiple possible sequences of operations leading to the maximum number — print any of them.

Examples

Input

5
5 -2 0 1 -3

Output

2 3
1 1 2
1 2 4
1 4 5

Input

5
5 2 0 4 0

Output

1 3 5
2 5
1 1 2
1 2 4

Input

2
2 -1

Output

2 2

Input

4
0 -10 0 0

Output

1 1 2
1 2 3
1 3 4

Input

4
0 0 0 0

Output

1 1 2
1 2 3
1 3 4

Note

Let X be the removed number in the array. Let's take a look at all the examples:

The first example has, for example, the following sequence of transformations of the array: [5,−2,0,1,−3]→[5,−2,X,1,−3]→[X,−10,X,1,−3]→

[X,X,X,−10,−3]→[X,X,X,X,30]. Thus, the maximum answer is 30. Note, that other sequences that lead to the answer 30

are also correct.

The second example has, for example, the following sequence of transformations of the array: [5,2,0,4,0]→[5,2,X,4,0]→[5,2,X,4,X]→[X,10,X,4,X]→

[X,X,X,40,X]

. The following answer is also allowed:

1 5 3
1 4 2
1 2 1
2 3

Then the sequence of transformations of the array will look like this: [5,2,0,4,0]→[5,2,0,4,X]→[5,8,0,X,X]→[40,X,0,X,X]→

[40,X,X,X,X].

The third example can have the following sequence of transformations of the array: [2,−1]→[2,X].

The fourth example can have the following

sequence of transformations of the array [0,−10,0,0]→[X,0,0,0]→[X,X,0,0]→[X,X,X,0].

The fifth example can have the following sequence of transformations of the array: [0,0,0,0]→[X,0,0,0]→[X,X,0,0]→[X,X,X,0].

题意：给你一个序列，然后你有n-1个操作，每一个操作只有两种类型，要么是把第i，j位的数相乘，放在第j位，把第i位的数给删除，要么就是把某一位的数给删除，这种删除操作最多进行一次，然后让你求能得到最大数的n-1次操作。

解题思路：

做题的时候没想到一点：如果出现多个零的话 可以相乘抵消掉，出现奇数个负数的时候就可以和0相乘抵消或者直接消除掉。

之后就是暴力模拟就行。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
const int inf=0x3f3f3f3f;
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
int n,m;
vector<int> ve1,ve2;
int main(){
	int i,j,flag=0,u,v;
	scanf("%d",&n);
	int ma=-inf;v=-1;
	for(i=1;i<=n;i++){
		scanf("%d",&m);
		if(!m) ve1.push_back(i);
		else if(m>0) ve2.push_back(i);
		else if(m<0){
			flag=!flag;
			if(m>ma){
				if(v!=-1) ve2.push_back(v);
				v=i;ma=m;
			}
			else ve2.push_back(i);
		}
	}
	if(flag&&v){
		ve1.push_back(v);
	}
	else if(v!=-1&&!flag)ve2.push_back(v);
	int len=ve1.size();
	j=inf;
	for(i=0;i<len;i++){
		if(j!=inf){
			printf("1 %d %d\n",j,ve1[i]);
		}
		j=ve1[i];
	}
	int len1=ve2.size();
	if(len1){
		if(len) printf("2 %d\n",j);
		j=inf;
		for(i=0;i<len1;i++){
			if(j!=inf) printf("1 %d %d\n",j,ve2[i]);
			j=ve2[i];
		}
	}
	return 0;
}