#include <bits/stdc++.h>
#define val first
#define id second
#define pii pair<ll, ll>
typedef long long ll;
const ll MOD = 1000000007LL;
const ll INF = 1e15;
using namespace std;
ll n, tmpx[150010], tmpy[150010], tmpz[150010];
vector<pii> x, y, z;
bool vis[150010];
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> tmpx[i] >> tmpy[i] >> tmpz[i];
x.push_back({tmpx[i], i});
y.push_back({tmpy[i], i});
z.push_back({tmpz[i], i});
vis[i] = 1;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
sort(z.begin(), z.end());
while (!x.empty() && !y.empty() && !z.empty()) {
if (y.back().val == tmpy[x.back().id] || z.back().val == tmpz[x.back().id]) {
vis[x.back().id] = 0;
}
else if (x.back().val == tmpx[y.back().id] || z.back().val == tmpz[y.back().id]) {
vis[y.back().id] = 0;
}
else if (x.back().val == tmpx[z.back().id] || y.back().val == tmpy[z.back().id]) {
vis[z.back().id] = 0;
}
else {
cout << x.back().val+y.back().val+z.back().val << "\n";
return 0;
}
while (!x.empty() && !vis[x.back().id]) x.pop_back();
while (!y.empty() && !vis[y.back().id]) y.pop_back();
while (!z.empty() && !vis[z.back().id]) z.pop_back();
}
cout << "-1\n";
return 0;
}
