#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;struct Member
{int color = 0;vector<int> s, p;//son,parent
}mbs[100001];bool is[100001];//unstable
int N;bool all_colored(int v, int color)
{bool res = true;for(int i = 0; res && i < mbs[v].p.size(); i++)res &= (mbs[mbs[v].p[i]].color == color);return res;
}void topo(int v)
{if(mbs[v].color != 0)return;int color = v;mbs[v].color = v;queue<int> que;que.push(v);while(!que.empty()){int u = que.front();que.pop();for(int i = 0; i < mbs[u].s.size(); i++){int s = mbs[u].s[i];if(all_colored(s, color)){mbs[s].color = color;que.push(s);is[s] = true;}}}}int main()
{cin >> N;for(int i = 1; i <= N; i++){int K;cin >> K;for(int j = 0; j < K; j++){int p;cin >> p;mbs[p].s.push_back(i);mbs[i].p.push_back(p);}}memset(is, 0, sizeof(is));for(int i = 1; i <= N; i++)topo(i);int res = 0;for(int i = 1; i <= N; i++)res += is[i];cout << N - res << endl;return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>using namespace std;
vector<vector<int>> members;
map<int, int>stableMap;//map存储某个学员的汇聚点int stableNum(int num)
{if (stableMap.find(num) != stableMap.end()) {return stableMap[num];}vector<int> mentors = members[num-1];if (find(mentors.begin(), mentors.end(), 0) != mentors.end()) {stableMap.insert(make_pair(num, num));return num;}else if (mentors.size() == 1){int stable = stableNum(mentors[0]);stableMap.insert(make_pair(mentors[0], stable));return stable;}else{int stable = stableNum(mentors[0]);stableMap.insert(make_pair(mentors[0], stable));for (int i = 1; i < mentors.size(); i++) {int temp = stableNum(mentors[i]);stableMap.insert(make_pair(mentors[i], temp));if (stable != temp) {stableMap.insert(make_pair(num, num));return num;}}stableMap.insert(make_pair(num, stable));return stable;}
}void numOfStableM()
{int sum = 0;for (int i = 0; i < members.size(); i++) {vector<int> mentors = members[i];if (find(mentors.begin(), mentors.end(), 0) != mentors.end()) {sum++;}else if (mentors.size() > 1){if (stableNum(i+1) == i+1) {sum++;}}}cout<<sum<<endl;
}int main() {int N;scanf("%d",&N);while (N--) {int K;scanf("%d",&K);vector<int> mentors;while (K--) {int mentor;scanf("%d",&mentor);mentors.push_back(mentor);}members.push_back(mentors);}numOfStableM();return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;  const int maxn = 100005;
struct Edge
{  int to,next;
}edge[maxn*10];
int n,cnt,ans,head[maxn],deg[maxn];
int dep[maxn],parent[maxn],tmp[15]; //tmp[i]表示第i个直接前驱回溯到的节点
vector<int> g[maxn];  void addedge(int u,int v)
{  edge[cnt].to = v;  edge[cnt].next = head[u];  head[u] = cnt++;
}  int LCA(int u)
{  int min_dep = -1;  for(int i = 0; i < g[u].size(); i++)  {  int v = g[u][i];  tmp[i] = v;  if(min_dep == -1 || min_dep > dep[v])  min_dep = dep[v];  }  for(int i = 0; i < g[u].size(); i++)  {  while(dep[tmp[i]] > min_dep)  tmp[i] = parent[tmp[i]];  }  while(true)  {  int i;  for(i = 1; i < g[u].size(); i++)  if(tmp[i] != tmp[0])  break;  if(i >= g[u].size()) break;  for(int i = 0; i < g[u].size(); i++)  tmp[i] = parent[tmp[i]];  }  return tmp[0];
}  void bfs()
{  queue<int> q;  for(int i = 0; i <= n; i++)  if(deg[i] == 0)  q.push(i);  while(!q.empty())  {  int u = q.front();  q.pop();  for(int i = head[u]; i != -1; i = edge[i].next)  {  int v = edge[i].to;  deg[v]--;  if(deg[v] == 0)  {  parent[v] = LCA(v);  dep[v] = dep[parent[v]] + 1;  if(parent[v] == 0) ans++;  q.push(v);  }  }  }
}  int main()
{  while(scanf("%d",&n)!=EOF)  {  memset(head,-1,sizeof(head));  memset(deg,0,sizeof(deg));  for(int i = 0; i <= n; i++) g[i].clear();  for(int i = 1; i <= n; i++)  {  int k;  scanf("%d",&k);  for(int j = 1; j <= k; j++)  {  int u;  scanf("%d",&u);  addedge(u,i);  //childg[i].push_back(u); //parentdeg[i]++;  //in degree}  }  ans = 0;  bfs();  printf("%d\n",ans);  }  return 0;
}