#include<stdio.h>
#include<stdlib.h>
#define maximam(a,b) ((a)>(b))?(a):(b)
typedef struct{
	long x,y,z;
	long s;
	int n;
} box;

int cmp(const void *a, const void *b){
	return ((box *)a)->s-((box *)b)->s;
}

int avail(box a, box b){
	if(a.s==b.s) return 0;
	if(a.x>b.x && a.y>b.y && a.z>b.z) return 1;
	if(a.x>b.x && a.y>b.z && a.z>b.y) return 1;
	if(a.x>b.y && a.y>b.x && a.z>b.z) return 1;
	if(a.x>b.y && a.y>b.z && a.z>b.x) return 1;
	if(a.x>b.z && a.y>b.x && a.z>b.y) return 1;
	if(a.x>b.z && a.y>b.y && a.z>b.x) return 1;
}

int main(int argc, char const *argv[]){
	int n,i,j,max=1,p;
	box b[1000];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%ld %ld %ld",&b[i].x,&b[i].y,&b[i].z);
		b[i].s=b[i].x+b[i].y+b[i].z;
		b[i].n=1;
	}
	qsort(b,n,sizeof(box),cmp);
	for(i=0;i<n;i++){
		p=b[i].n;
		for(j=0;j<i;j++){
			if(avail(b[i],b[j])) b[i].n=maximam(b[i].n,p+b[j].n);
		}
		max=maximam(b[i].n,max);
	}
	printf("%d\n",max);
	return 0;
}