求问

#include<bits/stdc++.h>
using namespace std;
int n;
int ans=0;
struct cj{
	int a,b,c;
}road[105];
bool cmp(cj x,cj y){
	return x.a>y.a||x.a==y.a&&x.b>y.b||x.a==y.a&&x.b==y.b&&x.c>y.c;
} 
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>road[i].a>>road[i].b>>road[i].c;
	sort(road+1,road+n+1,cmp);
	ans=1;
	for(int i=2;i<=n;i++){
		//cout<<road[i].a<<" "<<road[i].b<<" "<<road[i].c<<endl;
		if((road[i-1].a==1&&road[i].a==0&&road[i].b==1)||(road[i-1].b==1&&road[i].b==0&&road[i].c==1)){
			ans++;
			//cout<<i<<endl;
		}
		else continue;
	} 
	cout<<ans;
	return 0;
}