import java.util.*;

public class Main {
	static final Scanner s = new Scanner(System.in);
	public static void main(String args[]){
		Box[] boxes = new Box[s.nextInt()];
		for(int i=0;i<boxes.length;i++)
			boxes[i]=new Box(s.nextInt(), s.nextInt(), s.nextInt());

		Arrays.sort(boxes);
		//Arrays.stream(boxes).forEach(System.out::println);

		int nest=1;
		Box inner = boxes[0];
		for(int i=1;i<boxes.length;i++) {
			if(boxes[i].isRearryLargerThan(inner)) {
				inner=(boxes[i]);
				nest++;
			}
		}
		System.out.println(nest);
	}
}
class Box implements Comparable<Box>{
	int v[];
	public Box(int x,int y,int z) {
		v = new int[]{x,y,z};
		Arrays.sort(v);
	}
	public boolean isRearryLargerThan(Box b) {
		return v[0]>b.v[0]&&v[1]>b.v[1]&&v[2]>b.v[2];
	}
	@Override
	public int compareTo(Box o) {
		if(v[0]-o.v[0]!=0) return v[0]-o.v[0];
		if(v[1]-o.v[1]!=0) return v[1]-o.v[1];
		return v[2]-o.v[2];
	}
	@Override
	public String toString() {
		return Arrays.toString(v);
	}
}