n = int(input())
students = []
for _ in range(n):
    parts = list(map(int, input().split()))
    students.append(parts)

subjects = [0, 1, 2, 3, 4, 5]  # M, I, P, C, B, E
K = 5
candidates = set()

for s in subjects:
    sorted_indices = sorted(range(n), key=lambda i: (-students[i][s], i))
    top_k = sorted_indices[:K]
    for idx in top_k:
        candidates.add(idx)

candidates = list(candidates)
max_product = 0

from itertools import combinations

for combo in combinations(candidates, 4):
    max_m = max(students[i][0] for i in combo)
    max_i = max(students[i][1] for i in combo)
    max_p = max(students[i][2] for i in combo)
    max_c = max(students[i][3] for i in combo)
    max_b = max(students[i][4] for i in combo)
    max_e = max(students[i][5] for i in combo)
    product = max_m * max_i * max_p * max_c * max_b * max_e
    if product > max_product:
        max_product = product

print(max_product)