#include<stdio.h>
#include<stdlib.h>

#define POS(index,kind) ((kind)*n+(index))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))

int comp(int* array,int n,int i,int j){
  int k;
  for(k=0;k<3;k++){
    if(array[POS(i,k)]<=array[POS(j,k)]){
      return 0;
    }
  }
  return 1;
}

int calc(int i,int *array,int n,int *res){
  if(res[i]>0) return res[i];
  int j;
  int flag=1;
  for(j=0;j<n;j++){
    if(comp(array,n,i,j)){
      flag=0;
      res[i]=MAX(res[i],1+calc(j,array,n,res));
    }
  }
  if(flag){
    res[i]=1;
  }
  return res[i];
}

void run(void){
  int n;
  scanf("%d",&n);
  int *array=(int *)malloc(sizeof(int)*n*3);
  int i;
  for(i=0;i<n;i++){
    int x,y,z;
    scanf("%d%d%d",&x,&y,&z);
    array[POS(i,0)]=MAX(x,MAX(y,z));
    array[POS(i,2)]=MIN(x,MIN(y,z));
    array[POS(i,1)]=x+y+z-array[POS(i,0)]-array[POS(i,2)];
  }
  int *res=(int *)calloc(n,sizeof(int));
  for(i=0;i<n;i++){
    if(res[i]>0)
      continue;
    calc(i,array,n,res);
  }
  int ans=1;
  for(i=0;i<n;i++){
    ans=MAX(ans,res[i]);
  }
  printf("%d\n",ans);
  free(array);
  return;
}

int main(void){
  run();
  return 0;
}