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:
import java.io.*;
import java.math.BigInteger;
import java.util.*;

/**
 * @author ramilagger
 */
public class Main {

    final static boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    class Cube {
        int ind;
        int a[];
        Cube(int i,int...b){
            Arrays.sort(b);
            ind = i;
            this.a = new int[3];
            for (int j = 0; j < 3; j++) this.a[j] = b[j];
        }
    }

    class Val implements Comparable<Val> {
        int ind,val;

        public Val(int ind, int val) {
            this.ind = ind;
            this.val = val;
        }

        @Override
        public int compareTo(Val o) {
            return Integer.compare(o.val,this.val);
        }
    }

    class Pair implements Comparable<Pair>{

        int x,y;

        Pair(int x, int y) {
            this.x = Math.min(x,y);
            this.y = Math.max(x,y);
        }

        @Override
        public boolean equals(Object o) {
            if (this == o)
                return true;
            if (o == null || getClass() != o.getClass())
                return false;

            Pair p = (Pair) o;

            return this.x == p.x && this.y == y;

        }

        @Override
        public int hashCode() {
            return 31 * x + y;
        }

        @Override
        public int compareTo(Pair o) {
            if(Integer.compare(o.x,this.x) == 0) return Integer.compare(o.y,this.y);
            return Integer.compare(o.x,this.x);
        }
    }


    void solve() {
        int n = nextInt();
        TreeMap<Pair,PriorityQueue> map = new TreeMap<>();
        Cube[] cubes = new Cube[n];
        for (int i = 0; i < n; i++) {
            int x = nextInt(), y = nextInt(), z = nextInt();
            Cube c = new Cube(i,x,y,z);
            cubes[i] = c;
            Pair ps[] = new Pair[3];
            ps[0] = new Pair(x,y);
            ps[1]  = new Pair(x,z);
            ps[2]  = new Pair(z,y);
            int [] val = {z,y,x};
            for (int j = 0; j < 3; j++) {
                if (map.get(ps[j]) == null)
                    map.put(ps[j],new PriorityQueue<Val>());
                else {
                    PriorityQueue<Val> q = map.get(ps[j]);
                    q.add(new Val(i,val[j]));
                    map.put(ps[j],q);
                }
            }
        }
        int max = cubes[0].a[0];
        int ind = 0;
        for (int i = 1; i < n; i++) {
            if(cubes[i].a[0] > max){
                max = cubes[i].a[0];
                ind = i;
            }
        }
        boolean found = false;
        int f = 0;
        int s = 0;
        for (int i = 0; i < n; i++) {
            Cube c = cubes[i];
            PriorityQueue<Val> pq = map.get(new Pair(c.a[1],c.a[2]));
            if(pq != null && pq.peek() != null) {
                Val blya = pq.peek();
                while (blya != null && blya.ind == i)
                    blya = pq.poll();
                if(blya != null) {
                    int val = blya.val;
                    Cube check = new Cube(i, c.a[0] + val, c.a[1], c.a[2]);
                    if (check.a[0] > max) {
                        max = check.a[0];
                        found = true;
                        f = i;
                        s = blya.ind;
                    }
                }
            }
        }
        if(found) {
            pw.println(2);
            pw.println((f + 1) +" " + (s + 1));
        }else {
            pw.println(1);
            pw.println(ind + 1);
        }

    }



    public void run() throws IOException {
        start = System.currentTimeMillis();
        solve();
        if (!ONLINE_JUDGE)
           System.err.println(System.currentTimeMillis() - start + " ms");
        br.close();
        pw.close();
    }

    public Main() {
        try {
            br = (ONLINE_JUDGE) ? new BufferedReader(new InputStreamReader(System.in))
                    : new BufferedReader(new FileReader("in.txt"));
            pw = (ONLINE_JUDGE) ? new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)))
                    : new PrintWriter(new BufferedWriter(new FileWriter("out.txt")));
            this.run();
        } catch (Exception e) {
            e.printStackTrace();
            throw new RuntimeException();
        }
    }

    public static void main(String[] args) {
        new Main();
    }


    public boolean hasNext() {
        if (st != null && st.hasMoreTokens())
            return true;
        try {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
        } catch (Exception e) {
            return false;
        }
        return true;
    }

    public String next() {
        if (hasNext()) return st.nextToken();
        return null;
    }

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

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

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

    public BigInteger nextBigInteger() {
        return new BigInteger(next());
    }

    public String nextLine() {
        StringBuilder sb;
        try {
            while (st == null || !st.hasMoreTokens()) return br.readLine();
            sb = new StringBuilder(st.nextToken());
            while (st.hasMoreTokens()) sb.append(" " + st.nextToken());
        } catch (IOException e) {
            throw new RuntimeException();
        }
        return sb.toString();
    }

    public int[] nextArray(int n) {
        int[] temp = new int[n];
        for (int i = 0; i < n; i++)
            temp[i] = nextInt();
        return temp;
    }

    public long[] nextLArray(int n) {
        long[] temp = new long[n];
        for (int i = 0; i < n; i++)
            temp[i] = nextLong();
        return temp;
    }

    long start;
    final BufferedReader br;
    final PrintWriter pw;
    StringTokenizer st;

}