Codeforces Round #378 (Div. 2)-D. Kostya the Sculptor

D. Kostya the Sculptor

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a_i, b_i and c_i. 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 ≤ 10⁵).

n lines follow, in the i-th of which there are three integers a_i, b_i and c_i (1 ≤ a_i, b_i, c_i ≤ 10⁹) — 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.

/*
先找出最大的，然后按照不是最小的两个边排序，肯定只有相邻的能和平，看看合并之后是不是比最大的大
*/
#include <bits/stdc++.h>
using namespace std;
inline bool iseq(vector<int>& a, vector<int>&b) {
    return a[0] == b[0] && a[1] == b[1];
}
int main(){
    //freopen("C:\Users\acer\Desktop\in.txt","r",stdin);
    int n;
    scanf("%d", &n);
    vector<vector<int> >v(n,vector<int>(4));
    int mx = 0;
    vector<int> ans;
    for (int i = 0; i < n; ++i) {
        scanf("%d%d%d", &v[i][0], &v[i][1], &v[i][2]);
        sort(v[i].begin(), v[i].begin() + 3);
        v[i][3] = i;
        if (v[i][0] > mx) {
            ans.clear();
            ans.push_back(i);
            mx = v[i][0];
        }
        swap(v[i][0], v[i][2]);
    }
    sort(v.begin(), v.end());
    //for(int i=0;i<v.size();i++)
    //    cout<<v[i][0]<<" "<<v[i][1]<<" "<<v[i][2]<<" "<<v[i][3]<<" "<<endl;
    vector<int> dum;
    dum.push_back(-1);
    dum.push_back(-1);
    dum.push_back(-1);
    v.push_back(dum);
    for (int i = 2; i < n + 1; ++i) {
        if (!iseq(v[i] , v[i - 1]) && iseq(v[i - 1] , v[i - 2])) {
            if (mx < min(v[i - 1][2] + v[i - 2][2],min(v[i - 1][0], v[i - 1][1]))) {
                mx = min(v[i - 1][2] + v[i - 2][2],min(v[i - 1][0], v[i - 1][1]));
                ans.clear();
                ans.push_back(v[i - 1][3]);
                ans.push_back(v[i - 2][3]);
            }
        }
    }
    printf("%d
", (int)ans.size());
    for (int i = 0; i < (int)ans.size(); ++i) {
        printf("%d ", ans[i] + 1);
    }
    return 0;
}