#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
//typedef __int128 ull;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
int main()
{
ll n;
cin >> n;
vector<pi> xx, yy, zz;
vector<ll> x(n), y(n), z(n), kill(n, 0);
for (ll i=0; i<n; ++i)
{
cin >> x[i] >> y[i] >> z[i];
xx.pb(mp(x[i], i)); yy.pb(mp(y[i], i)); zz.pb(mp(z[i], i));
}
sort(all(xx), greater<pi> ()); sort(all(yy), greater<pi> ()); sort(all(zz), greater<pi> ());
ll ptr1 =0, ptr2 = 0, ptr3 = 0;
while (ptr1 < n && ptr2 < n && ptr3 < n)
{
ll x1 = xx[ptr1].s, y1 = yy[ptr2].s, z1 = zz[ptr3].s;
ll die = 0;
if (y[x1] == y[y1] || z[x1] == z[z1]) kill[x1] = die = 1;
if (x[y1] == x[x1] || z[y1] == z[z1]) kill[y1] = die = 1;
if (x[z1] == x[x1] || y[z1] == y[y1]) kill[z1] = die = 1;
if (!die)
{
cout << xx[ptr1].f + yy[ptr2].f + zz[ptr3].f << endl;
exit(0);
}
while (ptr1 < n && kill[xx[ptr1].s]) ptr1++;
while (ptr2 < n && kill[yy[ptr2].s]) ptr2++;
while (ptr3 < n && kill[zz[ptr3].s]) ptr3++;
}
cout << -1 << endl;
return 0;
}
