#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100010;
struct poi{
	int a,b,c;
}p[maxn];
int n,ans=(int)1e9;
bool cmp(poi x,poi y){
	return x.a<y.a;
	if(x.a==y.a)return x.b<y.b;
	else if(x.b==y.b)return x.c<y.c;
}
void dfs(int d,int a,int b,int c){
	int tmp=a+b+c;
	if(tmp>=ans)return;
	if(d==n+1){
		ans=min(ans,tmp);
		return;
	}
	if(p[d].a<=a||p[d].b<=b||p[d].c<=c){
		dfs(d+1,a,b,c);
		return;
	}
	dfs(d+1,p[d].a,b,c);
	dfs(d+1,a,p[d].b,c);
	dfs(d+1,a,b,p[d].c);
}
int main(){
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d%d",&p[i].a,&p[i].b,&p[i].c);
	sort(p+1,p+1+n,cmp);
	dfs(1,0,0,0);
	printf("%d\n",ans);
	return 0;
}