Problem: Kostya is a genial sculptor, he has an idea: to carve a marble sculpture in the shape of a sphere. Kostya has a friend Zahar who works at a career. Zahar knows about Kostya's idea and wants to present him a rectangular parallelepiped of marble from which he can carve the sphere. 

Zahar has n stones which are rectangular parallelepipeds. The edges sizes of the i-th of them are ai, bi and ci. He can take no more than two stones and present them to Kostya. 

If Zahar takes two stones, he should glue them together on one of the faces in order to get a new piece of rectangular parallelepiped of marble. Thus, it is possible to glue a pair of stones together if and only if two faces on which they are glued together match as rectangles. In such gluing it is allowed to rotate and flip the stones in any way. 

Help Zahar choose such a present so that Kostya can carve a sphere of the maximum possible volume and present it to Zahar.

Input

The first line contains the integer n (1 ≤ n ≤ 105).

n lines follow, in the i-th of which there are three integers ai, bi and ci (1 ≤ ai, bi, ci ≤ 109) — the lengths of edges of the i-th stone. Note, that two stones may have exactly the same sizes, but they still will be considered two different stones.

Output

In the first line print k (1 ≤ k ≤ 2) the number of stones which Zahar has chosen. In the second line print k distinct integers from 1 to n — the numbers of stones which Zahar needs to choose. Consider that stones are numbered from 1 to n in the order as they are given in the input data.

You can print the stones in arbitrary order. If there are several answers print any of them. 

Examples

Input

6
5 5 5
3 2 4
1 4 1
2 1 3
3 2 4
3 3 4


Output

1
1


Input

7
10 7 8
5 10 3
4 2 6
5 5 5
10 2 8
4 2 1
7 7 7


Output

2
1 5

Note

In the first example we can connect the pairs of stones:

  * 2 and 4, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
  * 2 and 5, the size of the parallelepiped: 3 × 2 × 8 or 6 × 2 × 4 or 3 × 4 × 4, the radius of the inscribed sphere 1, or 1, or 1.5 respectively. 
  * 2 and 6, the size of the parallelepiped: 3 × 5 × 4, the radius of the inscribed sphere 1.5
  * 4 and 5, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
  * 5 and 6, the size of the parallelepiped: 3 × 4 × 5, the radius of the inscribed sphere 1.5



Or take only one stone:

  * 1 the size of the parallelepiped: 5 × 5 × 5, the radius of the inscribed sphere 2.5
  * 2 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
  * 3 the size of the parallelepiped: 1 × 4 × 1, the radius of the inscribed sphere 0.5
  * 4 the size of the parallelepiped: 2 × 1 × 3, the radius of the inscribed sphere 0.5
  * 5 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
  * 6 the size of the parallelepiped: 3 × 3 × 4, the radius of the inscribed sphere 1.5



It is most profitable to take only the first stone. 

Solution (in JAVA):

Solution:
/*
Did I say something wrong? Did you hear what I was thinking?
Did I talk way too long when I told you all my feelings that night?
Is it you? Is it me? Did you find somebody better?
Someone who isn't me, 'cause I know that I was never your type
Never really your type
Overthinking's got me drinking
Messing with my head, whoa
Tell me what you hate about me
Whatever it is, I'm sorry
Yeah, yeah, yeah, yeah, yeah, yeah
I know I can be dramatic
But everybody said we had it
Yeah, yeah, yeah, yeah, yeah, yeah
I'm coming to terms with a broken heart
I guess that sometimes good things fall apart
When you said it was real, guess I really did believe you
Did you fake how you feel when we parked down by the river that night?
That night?
That night when we fogged up the windows in your best friend's car
'Cause we couldn't leave the windows down in December
Whoa
Tell me what you hate about me
Whatever it is, I'm sorry
Yeah, yeah, yeah, yeah, yeah, yeah
I know I can be dramatic
But everybody said we had it
Yeah, yeah, yeah, yeah, yeah, yeah
I'm coming to terms with a broken heart
I guess that sometimes good things fall apart
Overthinking's got me drinking
Messing with my head, oh
Tell me what you hate about me (about me)
Whatever it is, I'm sorry (oh, I'm sorry)
Yeah, yeah, yeah (oh, I'm sorry), yeah, yeah, yeah
I know I can be dramatic (I know I can be)
Everybody said we had it
Yeah, yeah, yeah, yeah, yeah, yeah
I'm coming to terms with a broken heart
I guess that sometimes good things fall apart
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
import java.math.*;
public class Main
{

static ArrayList<Integer> a[];
static boolean vis[]=new boolean[2000009];
static int time=0;
static int ans[]=new int[2000009];
    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }


    public static void main(String[] args)
    {
        FastReader sc=new FastReader();
        StringBuilder sb=new StringBuilder();
        //hashmap implementations ***yuckkk***
        int n = sc.nextInt();
        int max = 0, a= -1, b= -1;
        HashMap<String, Pair> map = new HashMap<>();
        int arr[] = new int[3];
        for(int i=0; i<n; i++)
        {
            int temp = Integer.MAX_VALUE;
            for(int j=0; j<3; j++)
            {
                arr[j] = sc.nextInt();
              
            }
              Arrays.sort(arr);
              temp=arr[0];
            if(temp > max)
            {
                max = temp;
                a = i;
                b= -1;
            }
          
            int val = arr[2], pos = i;
            if(map.containsKey(arr[0]+" "+arr[1]))
            {
                Pair pp = map.get(arr[0] +" "+arr[1]);
                temp = Math.min(pp.x + arr[2], Math.min(arr[0], arr[1]));
                if(pos != pp.y && temp > max)
                {
                    max = temp;
                    a = i;
                    b = pp.y;
                }
                if(pp.x > val)
                {
                    val = pp.x;
                    pos = pp.y;
                }
            }
            map.put(arr[0]+" "+arr[1], new Pair(val,pos));

            val = arr[0]; pos = i;
            if(map.containsKey(arr[1]+" "+arr[2]))
            {
                Pair pp = map.get(arr[1] +" "+arr[2]);
                temp = Math.min(pp.x + arr[0], Math.min(arr[1], arr[2]));
                if(pos != pp.y && temp > max)
                {
                    max = temp;
                    a = i;
                    b = pp.y;
                }
                if(pp.x > val)
                {
                    val = pp.x;
                    pos = pp.y;
                }
            }
            map.put(arr[1]+" "+arr[2], new Pair(val,pos));

            val = arr[1]; pos = i;
            if(map.containsKey(arr[0]+" "+arr[2]))
            {
                Pair pp = map.get(arr[0] +" "+arr[2]);
                temp = Math.min(pp.x + arr[1], Math.min(arr[0], arr[2]));
                if(pos != pp.y && temp > max)
                {
                    max = temp;
                    a = i;
                    b = pp.y;
                }
                if(pp.x > val)
                {
                    val = pp.x;
                    pos = pp.y;
                }
            }
            map.put(arr[0]+" "+arr[2], new Pair(val,pos));

        }

        if(b==-1)
        {
          System.out.println(1);
            System.out.println(a+1);
        }
        else
        {
            System.out.println(2);
            System.out.println((a+1)+" "+(b+1));

        }
    }
    }

class Pair implements Comparable{
      int x,y;

      Pair(int x, int y)
      {
          this.x = x;
          this.y = y;
      }
      @Override
      public int compareTo(Object o)
      {
          Pair pp = (Pair)o;
          if(pp.x == x)
              return 0;
          else if (x>pp.x)
              return 1;
          else
              return -1;
      }
  }