#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> M(N), I(N), P(N), C(N), B(N), E(N);
  for (int i = 0; i < N; i++){
    cin >> M[i] >> I[i] >> P[i] >> C[i] >> B[i] >> E[i];
  }
  vector<vector<int>> A(N, vector<int>(6));
  for (int i = 0; i < N; i++){
    A[i][0] = M[i];
    A[i][1] = I[i];
    A[i][2] = P[i];
    A[i][3] = C[i];
    A[i][4] = B[i];
    A[i][5] = E[i];
  }
  vector<vector<long long>> dp(5, vector<long long>(1 << 6, 1));
  for (int i = 0; i < N; i++){
    vector<long long> pr(1 << 6, 1);
    for (int j = 0; j < (1 << 6); j++){
      for (int k = 0; k < 6; k++){
        if ((j >> k & 1) == 1){
          pr[j] *= A[i][k];
        }
      }
    }
    for (int j = 0; j < 4; j++){
      for (int k = 0; k < (1 << 6); k++){
        int s = (1 << 6) - 1 - k;
        for (int l = s; l > 0; l = (l - 1) & s){
          int k2 = k | l;
          dp[j + 1][k2] = max(dp[j + 1][k2], dp[j][k] * pr[l]);
        }
      }
    }
  }
  cout << dp[4][(1 << 6) - 1] << endl;
}