n = int(input())
M = [list(map(int, input().split())) for _ in range(n)]

DP = [0 for _ in range(1 << 6)]
for bit in range(1 << 6):
    L = []
    for i in range(6):
        if (bit >> i) & 1:
            L.append(i)
    for i in range(n):
        res = 1
        for j in L:
            res *= M[i][j]
        DP[bit] = max(DP[bit], res)

ans = 0
max_bit = (1 << 6) - 1
for bit1 in range(1 << 6):
    for bit2 in range(1 << 6):
        if bit1 & bit2:
            continue
        for bit3 in range(1 << 6):
            if (bit1 | bit2) & bit3:
                continue
            bit4 = max_bit ^ (bit1 | bit2 | bit3)
            ans = max(ans, DP[bit1] * DP[bit2] * DP[bit3] * DP[bit4])
print(ans)