#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 998244353;
long long int __gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
long long int poww(long long int a, long long int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << "\n";
}
void dispv(vector<long long int> &v) {
  for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
long long int divide(long long int a, long long int b, long long int md) {
  long long int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
const long long int size = 2e5 + 5;
long long int n;
long long int arr[size];
vector<long long int> zeros;
vector<long long int> nzeros;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fun();
  cin >> n;
  long long int fg = 0;
  long long int maxneg = INT_MIN, maxnegidx;
  for (long long int i = 1; i <= n; i++) {
    cin >> arr[i];
    if (arr[i] < 0) {
      fg ^= 1;
      if (maxneg < arr[i]) maxneg = arr[i], maxnegidx = i;
    }
  }
  for (long long int i = 1; i <= n; i++) {
    if (arr[i] > 0)
      nzeros.push_back(i);
    else {
      if (arr[i] == 0)
        zeros.push_back(i);
      else if (arr[i] < 0 && fg == 1 && maxnegidx == i)
        zeros.push_back(i), fg = 0;
      else
        nzeros.push_back(i);
    }
  }
  if (zeros.size()) {
    for (long long int i = 0; i < zeros.size() - 1; i++)
      cout << "1 " << zeros[i] << " " << zeros[i + 1] << "\n";
    if (zeros.size() != n) cout << "2 " << zeros[zeros.size() - 1] << "\n";
  }
  if (nzeros.size())
    for (long long int i = 0; i < nzeros.size() - 1; i++)
      cout << "1 " << nzeros[i] << " " << nzeros[i + 1] << "\n";
  return 0;
}
