//
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define FOR(i, j, n) for(int j = i; j < n; ++j)
#define forn(i, j, n) for(int j = i; j <= n; ++j)
#define nfor(i, j, n) for(int j = n; j >= i; --j)
#define sortv(vv) sort(vv.begin(), vv.end())
#define all(v) v.begin(), v.end()
#define ld long double
#define ull unsigned long long
using namespace std;
const int maxn=3e5+10,LOG=17,mod=1e9+7;
int block = 320, timer = 0;
const ld EPS = 1e-18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define bt(i) (1 << (i))
#define int ll
const int inf=2e18;
#define y1 yy
#define prev pre
#define pii pair <int, int>
int n, a[maxn], b[maxn], c[maxn];
main()
{
cin >> n;
forn(1, i, n)
{
cin >> a[i] >> b[i] >> c[i];
}
int ans = -inf;
forn(1, i, n)
{
forn(1, j, n)
{
forn(1, k, n)
{
if(a[i] > max(a[j], a[k]) && b[j] > max(b[i], b[k]) && c[k] > max(c[i], c[j]))
{
ans = max(ans, a[i] + b[j] + c[k]);
}
}
}
}
if(ans == -inf) cout << "-1";
else
cout << ans;
}
