/*input
8
1 1 1
1 1 5
1 5 1
5 1 1
1 5 5
5 1 5
5 5 1
5 5 5
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef unsigned long long int ll;
#define ld long double
#define pii pair<ll,ll>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())+1
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<P.f<<' '<<P.s;
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
return out;
}
ll mult(ll a,ll b){
if(a<0) a+=MOD;
return (a*b)%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1) res=mult(res,a);
a=mult(a,a);
b>>=1;
}
return res;
}
map<pii,vector<int>> mp[3];
multiset<int> ms[3];
int mx[3];
int arr[maxn][3];
bool del[maxn];
int32_t main(){
ios::sync_with_stdio(false),cin.tie(0);
int n;
cin>>n;
REP(i,n){
REP(j,3){
cin>>arr[i][j];
ms[j].insert(arr[i][j]);
}
int c=0;
REP(a,3) REP(b,a) mp[c++][{arr[i][a],arr[i][b]}].pb(i);
}
REP(i,n){
if(!sz(ms[0])) break;
REP(j,3) mx[j]=(*ms[j].rbegin());
set<int> ss;
int c=0;
REP(a,3) REP(b,a){
for(auto z:mp[c][{mx[a],mx[b]}]){
ss.insert(z);
}
mp[c][{mx[a],mx[b]}].clear();
++c;
}
for(int a:ss){
if(del[a]) continue;
del[a]=1;
REP(j,3) ms[j].erase(ms[j].find(arr[a][j]));
}
}
REP(j,3) mx[j]=0;
REP(j,n){
if(del[j]) continue;
REP(k,3) MXTO(mx[k],arr[j][k]);
}
if(!mx[0]) cout<<-1;
else cout<<mx[0]+mx[1]+mx[2];
}
