#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
struct trio{
int a, b, c;
};
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
vector<trio> vect(n);
vector<bool> del(n, 0);
vector<pii> a(n), b(n), c(n);
for (int i=0; i<n; ++i)cin>>vect[i].a>>vect[i].b>>vect[i].c, a[i]=mp(vect[i].a, i), b[i]=mp(vect[i].b, i), c[i]=mp(vect[i].c, i);
sort(a.begin(), a.end(), greater<pii>());
sort(b.begin(), b.end(), greater<pii>());
sort(c.begin(), c.end(), greater<pii>());
for (int i=0, j=0, k=0; max({i, j, k})<n;){
int x=a[i].se, y=b[j].se, z=c[k].se;
if (vect[x].b>=vect[y].b||vect[x].c>=vect[z].c)del[x]=1;
if (vect[y].a>=vect[x].a||vect[y].c>=vect[z].c)del[y]=1;
if (vect[z].b>=vect[y].b||vect[z].a>=vect[x].a)del[z]=1;
if (!(del[x]+del[y]+del[z])){
cout<<a[i].fi+b[j].fi+c[k].fi;
return 0;
}
while (i<n&&del[a[i].se])++i;
while (j<n&&del[b[j].se])++j;
while (k<n&&del[c[k].se])++k;
}
cout<<-1;
}
