#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n;
int s[10000][6];

int calc(vector<int> gid) {
	typedef pair<int, int> P;
	vector<P> persons[4];
	for (int id = 0; id < 4; id++) { //科目集合{i | gid[i] == id}担当のスコアを計算
		for (int i = 0; i < n; i++) {
			int score = 1;
			for (int j = 0; j < 6; j++) {
				if (gid[j] == id) {
					score *= s[i][j];
				}
			}
			persons[id].push_back(P(score, i));
		}
		sort(persons[id].begin(), persons[id].end(), greater<P>());
	}
	
	int ret = 0;
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			if (persons[0][i].second == persons[1][j].second) continue;
			for (int k = 0; k < 4; k++) {
				if (persons[0][i].second == persons[2][k].second) continue;
				if (persons[1][j].second == persons[2][k].second) continue;
				for (int l = 0; l < 4; l++) {
					if (persons[0][i].second == persons[3][l].second) continue;
					if (persons[1][j].second == persons[3][l].second) continue;
					if (persons[2][k].second == persons[3][l].second) continue;
					int score = persons[0][i].first * persons[1][j].first * persons[2][k].first * persons[3][l].first;
					ret = max(ret, score);
				}
			}
		}
	}
	return ret;
}

int dfs(int dep, vector<int> &gid, int high) {
	if (dep == 6) {
		return calc(gid);
	}
	
	int ret = 0;
	for (int i = 0; i <= high; i++) {
		gid.push_back(i);
		int res = dfs(dep + 1, gid, max(i + 1, high));
		ret = max(ret, res);
		gid.pop_back();
	}
	return ret;
}

signed main() {
	int i, j;
	
	cin >> n;
	rep(i, n) rep(j, 6) scanf("%lld", &s[i][j]);
	
	vector<int> gid;
	int ans = dfs(0, gid, 0);
	
	cout << ans << endl;
	return 0;
}