#include <bits/stdc++.h>

using namespace std;

bool liu[1145];

int main(){
	int n;
	cin >> n;
	vector<vector<int>> vec;
	for (int i = 1; i <= n; i++){
		int chang;
		cin >> chang;
		vec.push_back(vector<int>(chang+2,0));
		for (int j = 1; j <= chang; j++){
			cin >> vec[i-1][j];
		}
	}
	queue<int> kan;
	kan.push(1);
	//1
	int t = kan.size();
	for (int i = 1; i <= t; i++){
		int x = kan.front();
		kan.pop();
		liu[x] = 1;
		for (auto it : vec[x]){
			kan.push(it);
		}
	}
	//2
	t = kan.size();
	for (int i = 1; i <= t; i++){
		int x = kan.front();
		kan.pop();
		liu[x] = 1;
		for (auto it : vec[x]){
			kan.push(it);
		}
	}
	//3
	 t = kan.size();
	for (int i = 1; i <= t; i++){
		int x = kan.front();
		kan.pop();
		liu[x] = 1;
	}
	int cnt = 0;
	for (int i = 1; i < 114; i++){
		if(liu[i])cnt++;
	}
	cout << cnt;
	system("pause");
}