#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int S = 6;
  int n; cin >> n;
  vector mipcbe(n, vector(S, 0)); REP(i, n) REP(j, S) cin >> mipcbe[i][j];
  ll ans = 0;
  auto f = [&](auto&& f, int i, vector<vector<int>>& divs) -> void {
    if (i == S) {
      ll mul = 1;
      for (const vector<int>& div : divs) {
        ll mx = 0;
        REP(i, n) {
          ll tmp = 1;
          for (int s : div) tmp *= mipcbe[i][s];
          chmax(mx, tmp);
        }
        mul *= mx;
      }
      chmax(ans, mul);
      return;
    }
    REP(j, divs.size()) {
      divs[j].emplace_back(i);
      f(f, i + 1, divs);
      divs[j].pop_back();
    }
    if (divs.size() < 4) {
      divs.emplace_back(vector<int>{i});
      f(f, i + 1, divs);
      divs.pop_back();
    }
  };
  vector<vector<int>> divs;
  f(f, 0, divs);
  cout << ans << '\n';
  return 0;
}