/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T>
void read(vector<T>& v){
int n=v.size();
for(int i=0; i<n; i++)
cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
vector<T>ans;
for(T t:a)
if(ans.empty() || t!=ans.back())
ans.push_back(t);
return ans;
}
void solve();
int main(){
GLHF;
int t=1;
//cin >> t;
while(t--)
solve();
}
void solve() {
int n;
cin >> n;
vvi a(n,vi(3));
for(int i=0; i<n; i++)
read(a[i]);
multiset<int>X,Y,Z;
map<pi,int>xy,yz,xz;
map<pi,multiset<int>>xy_to_z,xz_to_y,yz_to_x;
for(int i=0; i<n; i++){
int x=a[i][0],y=a[i][1],z=a[i][2];
xy[{x,y}]++;
xz[{x,z}]++;
yz[{y,z}]++;
X.insert(x);
Y.insert(y);
Z.insert(z);
xy_to_z[{x,y}].insert(z);
xz_to_y[{x,z}].insert(y);
yz_to_x[{y,z}].insert(x);
}
while(X.size()){
int x=*X.rbegin(),y=*Y.rbegin(),z=*Z.rbegin();
if(xy[{x,y}])
z = *xy_to_z[{x,y}].begin();
else if(yz[{y,z}])
x = *yz_to_x[{y,z}].begin();
else if(xz[{x,z}])
y = *xz_to_y[{x,z}].begin();
else
break;
Z.erase(Z.find(z));
X.erase(X.find(x));
Y.erase(Y.find(y));
xy_to_z[{x,y}].erase(xy_to_z[{x,y}].find(z));
xz_to_y[{x,z}].erase(xz_to_y[{x,z}].find(y));
yz_to_x[{y,z}].erase(yz_to_x[{y,z}].find(x));
xy[{x,y}]--;
xz[{x,z}]--;
yz[{y,z}]--;
}
if(X.size())out(*X.rbegin()+*Y.rbegin()+*Z.rbegin())
else out(-1)
}
