#include<bits/stdc++.h>
using namespace std;
const int MAXN=1.5e5+5;
int a[MAXN],b[MAXN],c[MAXN];
bool vis[MAXN];
priority_queue <array<int,2>> A,B,C;
signed main() {
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) {
		scanf("%d%d%d",&a[i],&b[i],&c[i]);
		A.push({a[i],i}),B.push({b[i],i}),C.push({c[i],i});
	}
	while(A.size()&&B.size()&&C.size()) {
		int x=A.top()[1],y=B.top()[1],z=C.top()[1];
		if(x==y) vis[x]=true;
		if(y==z) vis[y]=true;
		if(z==x) vis[z]=true;
		if(!vis[x]&&!vis[y]&&!vis[z]) return printf("%d\n",a[x]+b[y]+c[z]),0;
		while(A.size()&&vis[A.top()[1]]) A.pop();
		while(B.size()&&vis[B.top()[1]]) B.pop();
		while(C.size()&&vis[C.top()[1]]) C.pop();
	}
	puts("-1");
	return 0;
}