Problem: 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 a_i ⋅ a_j 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 a_1, a_2, ..., a_n (-10^9 ≤ a_i ≤ 10^9) — 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~ i_k~ j_k, where 1 is the type of operation, i_k and j_k are the positions of the chosen elements.

The operation of the second type should look like this: 2~ i_k, where 2 is the type of operation, i_k 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].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll arr[200005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, prod = 1;
  ll tmp;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (arr[i] == 0)
      prod = 0;
    else
      prod *= (arr[i] > 0 ? 1 : -1);
  }
  if (prod > 0) {
    for (int i = 0; i < n - 1; i++) {
      cout << 1 << ' ' << i + 1 << ' ' << i + 2 << '\n';
    }
    return 0;
  }
  vector<int> z;
  set<int> avail;
  for (int i = 0; i < n; i++) avail.insert(i);
  for (int i = 0; i < n; i++)
    if (arr[i] == 0) {
      z.push_back(i);
    }
  ll mx = -1e9 - 5, cneg = 0;
  int npos = -1;
  for (int i = 0; i < n; i++)
    if (arr[i] < 0) {
      cneg++;
      if (arr[i] > mx) {
        mx = arr[i];
        npos = i;
      }
    }
  if (prod < 0) {
    cout << 2 << ' ' << npos + 1 << '\n';
    avail.erase(npos);
    while (avail.size() >= 2) {
      cout << 1 << ' ' << *avail.begin() + 1 << ' '
           << *(next(avail.begin())) + 1 << '\n';
      avail.erase(avail.begin());
    }
    return 0;
  }
  if (!(cneg & 1)) {
    for (int i = 0; i < min(n - 2, (int)z.size() - 1); i++) {
      cout << 1 << ' ' << z[i] + 1 << ' ' << z[i + 1] + 1 << '\n';
      avail.erase(z[i]);
    }
    cout << 2 << ' ' << z[min(n - 2, (int)z.size() - 1)] + 1 << '\n';
    avail.erase(z[min(n - 2, (int)z.size() - 1)]);
    while (avail.size() >= 2) {
      cout << 1 << ' ' << *avail.begin() + 1 << ' '
           << *(next(avail.begin())) + 1 << '\n';
      avail.erase(avail.begin());
    }
    return 0;
  }
  vector<int> rem;
  rem.push_back(npos);
  for (int i = 0; i < min(n - 2, (int)z.size()); i++) {
    rem.push_back(z[i]);
  }
  sort(rem.begin(), rem.end());
  for (int i = 0; i < (int)rem.size() - 1; i++) {
    cout << 1 << ' ' << rem[i] + 1 << ' ' << rem[i + 1] + 1 << '\n';
    avail.erase(rem[i]);
  }
  cout << 2 << ' ' << rem.back() + 1 << '\n';
  avail.erase(rem.back());
  while (avail.size() >= 2) {
    cout << 1 << ' ' << *avail.begin() + 1 << ' ' << *(next(avail.begin())) + 1
         << '\n';
    avail.erase(avail.begin());
  }
  return 0;
}