/**
* ┏┓ ┏┓
* ┏┛┗━━━━━━━┛┗━━━┓
* ┃ ┃
* ┃ ━ ┃
* ┃ > < ┃
* ┃ ┃
* ┃... ⌒ ... ┃
* ┃ ┃
* ┗━┓ ┏━┛
* ┃ ┃ Code is far away from bug with the animal protecting
* ┃ ┃ 神兽保佑,代码无bug
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┗━━━┓
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 200005
#define nm 1000005
#define pi 3.1415926535897931
using namespace std;
const int inf=1000000000;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t,v;edge*next,*rev;}e[nm],*h[NM],*o=e;
void _add(int x,int y,int v){o->t=y;o->v=v;o->next=h[x];h[x]=o++;}
void add(int x,int y,int v){_add(x,y,v);_add(y,x,0);h[x]->rev=h[y];h[y]->rev=h[x];}
int n,_,_x,b[NM];
void maxflow(){
int cnt[NM],tot=n+3,d[NM];edge*j,*p[NM],*tmp[NM];
mem(d);mem(cnt);mem(p);mem(tmp);
inc(i,0,n+2)tmp[i]=h[i];
cnt[0]=tot;
for(int x=n,s=inf;d[x]<tot;){
for(j=tmp[x];j;j=j->next)if(j->v&&d[j->t]+1==d[x])break;
if(j){
s=min(s,j->v);p[j->t]=tmp[x]=j;
if((x=j->t)==0){
for(;p[x];x=p[x]->rev->t)p[x]->v-=s,p[x]->rev->v+=s;
s=inf;
}
}else{
if(!--cnt[d[x]])break;d[x]=tot;
link(x)if(j->v&&d[x]>d[j->t]+1)d[x]=d[j->t]+1,tmp[x]=j;
cnt[d[x]]++;
if(p[x])x=p[x]->rev->t;
}
}
}
int main(){
freopen("data.in","r",stdin);
n=read();
inc(i,1,n){
_=read();if(!_)add(i,n+2,inf);
while(_--){_x=read();b[_x]++;add(i,_x,inf);add(n+1,_x,1);add(i,0,1);}
}
inc(i,1,n)if(!b[i])add(n+3,i,inf);
n++;
maxflow();
add(n+1,n+2,inf);
maxflow();
return 0*printf("%d\n",(--o)->v);
}