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 JAVA):

Solution:
/**
 * BaZ :D
 */
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class ACMIND
{
    static Reader scan;
    static PrintWriter pw;
    public static void main(String[] args) {
        new Thread(null,null,"BaZ",1<<25)
        {
            public void run()
            {
                try
                {
                    solve();
                }
                catch(Exception e)
                {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }
    static void solve() throws IOException
    {
        scan = new Reader();
        pw = new PrintWriter(System.out,true);
        StringBuilder sb = new StringBuilder();
        int n = ni();
        int arr[] = new int[n+1];
        int ans[][] = new int[n-1][3];
        HashSet<Integer> pos = new HashSet();
        TreeSet<Pair> neg = new TreeSet();
        HashSet<Integer> zeros = new HashSet();
        for(int i=1;i<=n;++i) {
            arr[i] = ni();
            if(arr[i]==0)
                zeros.add(i);
            else if(arr[i]<0)
                neg.add(new Pair(arr[i],i));
            else pos.add(i);
        }
        ArrayList<Pair> negg = new ArrayList<>();
        for(Pair p:neg)
            negg.add(p);
        int idx = 0;
        for(int i=0;i<negg.size();i+=2) {
            if(i+1<negg.size()) {
                Pair first = negg.get(i);
                Pair second = negg.get(i+1);
                neg.remove(first);
                neg.remove(second);
                ans[idx][0] = 1;
                ans[idx][1] = first.y;
                ans[idx][2] = second.y;
                pos.add(second.y);
                idx++;
            }
        }
        /*pl("neg set : ");
        for(Pair p:neg) {
            pl(p);
        }
        pl("------------");*/
        if(zeros.size()==0 && neg.size()==0) {
            ArrayList<Integer> poss = new ArrayList<>();
            for(int e:pos)
                poss.add(e);
            int sz = poss.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = poss.get(i);
                ans[idx][2] = poss.get(i+1);
                idx++;
            }
        }
        else if(zeros.size()==0 && neg.size()==1) {
            ans[idx][0] = 2;
            ans[idx][1] = neg.first().y;
            idx++;
            ArrayList<Integer> poss = new ArrayList<>();
            for(int e:pos)
                poss.add(e);
            int sz = poss.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = poss.get(i);
                ans[idx][2] = poss.get(i+1);
                idx++;
            }
        }
        else if(zeros.size()>0 && neg.size()==0) {
            ArrayList<Integer> zeross = new ArrayList<>();
            for(int e:zeros)
                zeross.add(e);
            int sz = zeross.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = zeross.get(i);
                ans[idx][2] = zeross.get(i+1);
                idx++;
            }
            if(idx<n-1) {
                ans[idx][0] = 2;
                ans[idx][1] = zeross.get(sz-1);
                idx++;}
            ArrayList<Integer> poss = new ArrayList<>();
            for(int e:pos)
                poss.add(e);
            sz = poss.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = poss.get(i);
                ans[idx][2] = poss.get(i+1);
                idx++;
            }
        }
        else {
            //pl("yaha");
            zeros.add(neg.first().y);
            ArrayList<Integer> zeross = new ArrayList<>();
            for(int e:zeros)
                zeross.add(e);
            int sz = zeross.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = zeross.get(i);
                ans[idx][2] = zeross.get(i+1);
                idx++;
            }
            if(idx<n-1) {
                ans[idx][0] = 2;
                ans[idx][1] = zeross.get(sz-1);
                idx++;}
            ArrayList<Integer> poss = new ArrayList<>();
            for(int e:pos)
                poss.add(e);
            sz = poss.size();
            for(int i=0;i<sz-1;i++) {
                ans[idx][0] = 1;
                ans[idx][1] = poss.get(i);
                ans[idx][2] = poss.get(i+1);
                idx++;
            }
        }
        for(int i=0;i<n-1;++i) {
            sb.append(ans[i][0]);
            sb.append(" ");
            sb.append(ans[i][1]);
            sb.append(" ");
            if(ans[i][0]!=2) {
                sb.append(ans[i][2]);
                sb.append(" ");
            }
            sb.append("\n");
        }
        psb(sb);
        pw.flush();
        pw.close();
    }
    static class Pair implements Comparable<Pair>
    {
        int x,y;
        Pair(int x,int y)
        {
            this.x=x;
            this.y=y;
        }
        public int compareTo(Pair other)
        {
            if(this.x!=other.x)
                return this.x-other.x;
            return this.y-other.y;
        }
        public String toString()
        {
            return "("+x+","+y+")";
        }
    }
    static int ni() throws IOException
    {
        return scan.nextInt();
    }
    static long nl() throws IOException
    {
        return scan.nextLong();
    }
    static double nd() throws IOException
    {
        return scan.nextDouble();
    }
    static void pl()
    {
        pw.println();
    }
    static void p(Object o)
    {
        pw.print(o+" ");
    }
    static void pl(Object o)
    {
        pw.println(o);
    }
    static void psb(StringBuilder sb)
    {
        pw.print(sb);
    }
    static void pa(String arrayName, Object arr[])
    {
        pl(arrayName+" : ");
        for(Object o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, int arr[])
    {
        pl(arrayName+" : ");
        for(int o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, long arr[])
    {
        pl(arrayName+" : ");
        for(long o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, double arr[])
    {
        pl(arrayName+" : ");
        for(double o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, char arr[])
    {
        pl(arrayName+" : ");
        for(char o : arr)
            p(o);
        pl();
    }
    static void pa(String listName, List list)
    {
        pl(listName+" : ");
        for(Object o : list)
            p(o);
        pl();
    }
    static void pa(String arrayName, Object[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(Object o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, int[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(int o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, long[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(long o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, char[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(char o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, double[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(double o : arr[i])
                p(o);
            pl();
        }
    }
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64];
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
            if (neg) return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1) buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead) fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null) return;
            din.close();
        }
    }
}