#pragma GCC optimize("O3,unroll-loops")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;

template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    constexpr int D = 6;
    vector dp(5, vector<lint>(1 << D, 1));

    int N;
    cin >> N;
    vector<lint> V(D);
    vector<lint> tmp(1 << D, 1);

    while (N--) {
        for (auto &x : V) cin >> x;
        tmp.assign(1 << D, 1);
        REP(s, 1 << D) {
            REP(i, D) {
                if ((s >> i) & 1) tmp[s] *= V[i];
            }
        }
        REP(d, 4) {
            REP(s, 1 << D) {
                for (int t = s; t > 0; t = (t - 1) & s) {
                    chmax(dp[d + 1][s], dp[d][s - t] * tmp[t]);
                }
            }
        }
    }
    cout << dp.back().back() << '\n';
}