#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,k,ans=LINF,res=0,viz[5005];
vector<ll>g[5005];
void bfs(ll node){
queue<pair<ll,ll>>q;
viz[node]=1;
q.push(mp(node,0));
while(!q.empty()){
pair<ll,ll>x=q.front();
viz[x.f]=1;
res+=1+x.s;
q.pop();
for(auto it : g[x.f]){
if(viz[it]){
continue;
}
viz[it]=1;
q.push(mp(it,x.s+1));
}
}
}
int32_t main(){
CODE_START;
cin>>n;
for(ll i=1;i<=n;i++)
{
cin>>k;
for(ll j=1;j<=k;j++)
{
ll x;
cin>>x;
g[x].pb(i);
}
}
for(ll i=1;i<=n;i++)
{
memset(viz,0,sizeof(viz));
res=0;
bfs(i);
ll s1=0;
for(ll j=1;j<=n;j++)
{
if(viz[j]==0){
s1++;
}
}
if(s1==0){
// cout<<i<<' '<<res<<endl;
ans=min(ans,res);
}
}
cout<<ans<<endl;
}
