28分，code:

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,num,f[205],b[205],cnt;
int find(int k){
	if(f[k]==k)return k;
	return f[k]=find(f[k]);
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=1;i<=n;i++){
		while(cin>>num,num){
			f[find(i)]=find(num);
		}
	}
	for(int i=1;i<=n;i++){
		if(b[find(i)]==0)cnt++,b[find(i)]=1;
	}
	cout<<cnt;
}