#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<ll,ll> P ;
typedef tuple<bool,ll,ll,ll> TP ;
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define endl "\n"

int n ;
vector<P> X[6] ;
ll A[1010][6] ;

int main(){
    cin >> n ;
    rep(i,n){
        rep(j,6) cin >> A[i][j] , X[j].push_back(P(A[i][j],i)) ;
    }
    rep(i,6) sort(X[i].begin(),X[i].end(),greater<P>()) ;
    ll res = 0 ;
    rep(S,1<<6){
        if(bit_count(S) != 4) continue ;
        vector<ll> vec(6,0) ;
        rep(i,6) if(S >> i & 1) vec[i] = X[i][0].first ;
        rep(i,6){
            if(!(S >> i & 1)) continue ;
            int j = 0 ;
            while(j < n && X[i][j].first == vec[i]){
                rep(k,6) if(!(S >> k & 1)) {
                    int id = X[i][j].second ;
                    vec[k] = max(vec[k],A[id][k]) ;
                }
                j++ ;
            }
        }
        ll sum = 1 ;
        rep(i,6) sum *= vec[i] ;
        chmax(res,sum) ;
    }
    cout << res << endl ;
}