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*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> and *c*<sub class="lower-index">*i*</sub>. 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.
The first line contains the integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>).

*n* lines follow, in the *i*-th of which there are three integers *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> and *c*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub>, *c*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — 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.
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.
6
5 5 5
3 2 4
1 4 1
2 1 3
3 2 4
3 3 4
1
1
7
10 7 8
5 10 3
4 2 6
5 5 5
10 2 8
4 2 1
7 7 7
2
1 5
1
1 1 1
1
1
2
2 3 1
2 2 3
2
2 1
1
1000000000 1000000000 1000000000
1
1
3
100 100 100
25 63 11
63 15 11
1
1
2
999999999 1000000000 1000000000
1000000000 1000000000 1000000000
2
2 1
3
1 1 2
1 2 2
1 1 1
1
1
3
500 1000 1000
1000 499 1000
999 999 999
2
1 2
3
500 1000 1000
1000 499 1000
1000 1001 1001
1
3
9
1 3 2
3 3 1
3 1 2
3 3 2
2 2 2
3 2 1
3 3 1
3 3 1
2 1 2
2
4 8
3
20 30 5
20 30 6
10 10 10
2
2 1
3
5 20 30
6 20 30
10 10 10
2
2 1
3
20 5 30
20 6 30
10 10 10
2
2 1
3
20 30 5
30 20 6
10 10 10
2
2 1
3
20 30 5
6 20 30
10 10 10
2
2 1
3
20 30 5
6 30 20
10 10 10
2
2 1
3
20 30 5
20 6 30
10 10 10
2
2 1
3
20 30 5
30 6 20
10 10 10
2
2 1
3
20 5 30
20 30 6
10 10 10
2
2 1
3
20 5 30
30 20 6
10 10 10
2
2 1
3
20 5 30
6 20 30
10 10 10
2
2 1
3
20 5 30
6 30 20
10 10 10
2
2 1
3
20 5 30
30 6 20
10 10 10
2
2 1
3
5 20 30
20 30 6
10 10 10
2
2 1
3
5 20 30
30 20 6
10 10 10
2
2 1
3
5 20 30
6 30 20
10 10 10
2
2 1
3
5 20 30
20 6 30
10 10 10
2
2 1
3
5 20 30
30 6 20
10 10 10
2
2 1
class HashMap(object):

    def __init__(self, size=256):
        # self._values = [None for item in range(size)]
        self._keys = []
        self.data = [[0] for i in range(size)]
        self.numItems = 0
        self.size = size
    
    # def __getitem__(self,key):
        # if self._values[self.hashfunc(key)] is not None:
        #     return self._values[self.hashfunc(key)] 
        # else:
        #     return None

    def __setitem__(self,key,value):
        
        pos = self.set_find(key) #find empty space or old value
        if pos != -1:
            if len(self.data[pos]) > 1:
                if self.data[pos][0] == key:
                    try:
                        self.data[pos] = [key, value]
                    except:
                        print("Update failed!")
                        return False
                    return True
            
            self.data[pos] = [key, value]
            self.numItems += 1
   
            self._keys.append(key)            
            return True
        else:
            return False
        # if value is None:
        #     raise ValueError('None is not permitted as a value.')

        # if self._values[self.hashfunc(key)] is None:
        #     self._keys.append(key)
        #     self._values[self.hashfunc(key)] = value
        #     # print(float(len(self._keys))/len(self._values))
        #     if (self.size - len(self._keys)) == 2:
        #     # if float(len(self._keys))/len(self._values) > 0.1:
        #         self.__resize__()
        
        # else:
        #     if key in self._keys: 
        #         self._values[self.hashfunc(key)] = value
        #     else:
        #         self._keys.append(key)
        #         self._values[self.hashfunc(key)] = value
        #         # self.__resize__() # resize values
        #         # self.__setitem__(key,value) 

    def __missing__(self,not_key):
        raise KeyError('{0} is not a valid key'.format(not_key))

    def __getitem__(self, key):
        pos = self.get_find(key)
        if pos == -1:
            return None
        else:
            return self.data[pos][1]

    def __repr__(self):
        # list_repr = ['{0}:{1}'.format(key, self._values[self.hashfunc(key)]) for key in self._keys]
        return str(self.data)
        return 'HashMap({0})'.format(list_repr)

    def __contains__(self,key):
        if key in self._keys:
            return True
        else:
            return False

    def __len__(self):
        return len(self._keys)

    def __iter__(self):
        return (key for key in self._keys)

    def hashfunc(self,key): # with collision
        print(hash(key))
        return hash(key) % len(self._values)

    def set_find(self, key):
        
        collisionNum = 0
        currentPos = hash(key) % self.size #hash key
        
        while self.data[currentPos][0] != 0 and self.data[currentPos][0]!=key:
            """quadratic resolution"""
            collisionNum += 1
            currentPos = (currentPos + collisionNum**2) % self.size
            """alternate way of calculating
            currentPos += 2*collisionNum - 1
            if currentPos >= self.capacity:
                currentPos -= self.capacity
            """
            if collisionNum > self.size:
                return -1 
                """this doesn't mean there aren't empty slots, but at this
                point you're better off rehashing"""
            
        return currentPos

    
    def get_find(self, key):
        collisionNum = 0
        currentPos = hash(key) % self.size #hash key
        while True:
            while self.data[currentPos][0] != 0 and self.data[currentPos][0]!=key:
                collisionNum += 1
                currentPos = (currentPos + collisionNum**2) % self.size
                if collisionNum > self.size:
                    return -1 
            if self.data[currentPos][0] == 0:
                if len(self.data[currentPos]) == 1:
                    return -1
                else:
                    collisionNum += 1
                    currentPos = (currentPos + collisionNum**2) % self.size
            else: #found key
                return currentPos 

    # def __resize__(self,**kwargs):
    #     old_values = kwargs.get('values',[self._values[self.hashfunc(key)] for key in self._keys])
    #     self._values = [None for item in range(2*len(self._values))]
    #     for key, value in zip(self._keys,old_values):
    #         if self._values[self.hashfunc(key)] is None: 
    #             self._values[self.hashfunc(key)] = value
    #         else:
    #             self.__resize__(values = old_values)


class hashMap:
    def __init__(self, capacity = 1009): #capacity is 1009 if not specified
        self.capacity = capacity #preallocated space
        self.numItems = 0        #number of stored values
    
        self.data = [[0] for i in range(capacity)]

    def set(self, key, obj):
        pos = self.set_find(key) #find empty space or old value
        if pos != -1:
            if len(self.data[pos]) > 1:
                if self.data[pos][0] == key:
                    try:
                        self.data[pos] = [key, obj]
                    except:
                        print("Update failed!")
                        return False
                    return True
            try:
                self.data[pos] = [key, obj]
                self.numItems += 1
            except:
                print("Insert failed!")
                return False
            return True
        else:
            return False
    
    def get(self, key):
        pos = self.get_find(key)
        if pos == -1:
            return None
        else:
            return self.data[pos][1]
    
    def delete(self, key):
        pos = self.get_find(key)
        if pos == -1:
            return None
        else:
            self.data[pos][0] = 0 #lazy delete
            self.numItems -= 1
            return self.data[pos][1]
    
    def load(self):
        return self.numItems/self.capacity
    
    def rehash(self):
        oldData = self.data #copy over the data
        
        """
        self.capacity = 4*self.numItems
        """
        self.capacity = 2*self.capacity
        self.numItems = 0
        self.data = [[0] for i in range(self.capacity)]
        
        for i in range(len(oldData)):
            if oldData[i][0] != 0:
                self.set(oldData[i][0], oldData[i][1]) #reinsert item
    
    def set_find(self, key):
        
        collisionNum = 0
        currentPos = hash(key) % self.capacity #hash key
        
        while self.data[currentPos][0] != 0 and self.data[currentPos][0]!=key:
            """quadratic resolution"""
            collisionNum += 1
            currentPos = (currentPos + collisionNum**2) % self.capacity
            """alternate way of calculating
            currentPos += 2*collisionNum - 1
            if currentPos >= self.capacity:
                currentPos -= self.capacity
            """
            if collisionNum > self.capacity:
                return -1 
                """this doesn't mean there aren't empty slots, but at this
                point you're better off rehashing"""
            
        return currentPos

    def get_find(self, key):
        
        collisionNum = 0
        currentPos = hash(key) % self.capacity #hash key
        
        while True:
            while self.data[currentPos][0] != 0 and self.data[currentPos][0]!=key:
                """quadratic resolution"""
                collisionNum += 1
                currentPos = (currentPos + collisionNum**2) % self.capacity
                """
                currentPos += 2*collisionNum - 1
                if currentPos >= self.capacity:
                    currentPos -= self.capacity
                """
                if collisionNum > self.capacity:
                    return -1 
                    """this doesn't mean there aren't empty slots, but at this
                    point you're better off rehashing"""
                    
            if self.data[currentPos][0] == 0:
                if len(self.data[currentPos]) == 1:
                    return -1
                else:
                    collisionNum += 1
                    currentPos = (currentPos + collisionNum**2) % self.capacity
            else: #found key
                return currentPos 

 
    def __iter__(self):
        return (key for key in self.data)


def main():
    d = HashMap(256)
    m =  0

    with open("input.txt") as f_in:
        n = int(f_in.readline())
        for i in range(n):
            a, b, c = sorted(map(int, f_in.readline().split()))
            if (b, c) in d:
                x, y, z, t = d[b, c]
                if a > z:
                    d[b, c] = (a, i, x, y) if a > x else (x, y, a, i)
            else:
                d[b, c] = (a, i, 0, 0)

        for (a, b) in d._keys:
            (x, y, z, t)  = d._values[d.hashfunc((a,b))]
            if a > m < x + z:
                m, res = x + z if a > x + z else a, (y, t)

    print("m ", m)
    print("t ", t)
    print("res", res)
    print(("2\n%d %d" % res) if res[1] else ("1\n%d" % res[0]))

if __name__ == '__main__':
    answer = 0
    min_val = 0
    diam = 0
    with open("input.txt") as f_in:
        n = int(f_in.readline())
        shapes = HashMap(400)
        for i in range(n):
            face = list(sorted(map(int, f_in.readline().split())))
            key = (face[1], face[2])
            if key in shapes:

            # if shapes.get_find(key) != -1:
                # old, k = shapes[key]
                old, k = shapes[key]
                res = [old + face[0], face[1], face[2]]
                m = min(res)
                if m > min_val:
                    min_val = m
                    diam = m
                    mn = [k, i]
                if old < face[0]: # update min
                    # shapes.set(key, (face[0], i))
                    shapes[key] = (face[0], i)
            else:      
                # shapes.set(key, (face[0], i))
                shapes[key] = (face[0], i)

                # shapes.insert(new_key)
            m = face[0]    
            if m > min_val:
                diam = min(face)
                min_val = m
                mn = [i]

    # with open('output.txt','w') as f_out:
    #     f_out.write(str(len(mn)) + "\n"\
    #     + " ".join(map(lambda x: str(x+1), mn)) + "\n" \
    #      + str(min_val))

    print(len(mn))
    print(" ".join(map(lambda x: str(x+1), mn)))  