map 一面牆磚

# include<stdio.h>
# include<iostream>
# include<algorithm>
# include<string.h>
# include<map>
# include<set>
using namespace std;


int sum;
map<int,int>m;
int main(){
	int n,c;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&c);
		 sum=0;int temp;
		for(int i=1;i<=c;i++){
			scanf("%d",&temp);
			if(i==c){
				break;
			}
			sum=sum+temp;
			m[sum]++;
		}
	}
	int max=0;
	map<int,int>::iterator p;
	for(p=m.begin();p!=m.end();p++){
		if(p->second>max){
			max=p->second;
		}
	}
	printf("%d\n",n-max);
	
}