#include<iostream>
#include<cstdio>
#include<iomanip>
#include<memory.h>
#include<cstdlib>
#include<ctime>
#include<climits>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<bitset>
#include<map>
#include<unordered_map>
#include<stack>
#include<vector>
#include<queue>
#include<deque>
#include<list>
#define bug puts("liupei")
#define F(i,j,n) for(register int i=j;i<=n;++i)
#define R(i,j,n) for(register int i=j;i>=n;--i)
#define MAX_TIME 0.95
#define pii pair<int,int>
using namespace std;
const int N=5050;
const bool debug=0;
int n,k[N],ans;
vector<int>e[N];
bool vis[N];
queue<int>q;
signed main() {
	srand(time(0));
	scanf("%d",&n);
	F(i,1,n){
		scanf("%d",&k[i]);
		F(j,1,k[i]){
			int t;
			scanf("%d",&t);
			e[i].push_back(t);
		}
	}
	q.push(1);
	vis[1]=1;
	while(!q.empty()){
		int to=q.front();
		q.pop();
		vis[to]=1;
		for(auto v:e[to]){
			if(!vis[v])
			q.push(v);
		}
	}
	F(i,0,5010){
		if(vis[i]){
			++ans;
		}
	}
	printf("%d",ans);
	return 0;
}