#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=5010, LOG=20;
int n, m, k, u, v, x, y, t, a, b, ans=inf;
int dist[MAXN][MAXN];
vector<int> G[MAXN];
queue<int> Q;
void bfs(int *dist, int src){
dist[src]=0;
Q.push(src);
while (Q.size()){
int v=Q.front();
Q.pop();
for (int u:G[v]) if (dist[v]+1<dist[u]){
dist[u]=dist[v]+1;
Q.push(u);
}
}
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
memset(dist, 31, sizeof(dist));
cin>>n;
for (int i=1; i<=n; i++){
cin>>m;
while (m--){
cin>>x;
G[x].pb(i);
}
}
for (int i=1; i<=n; i++) bfs(dist[i], i);
for (int v=1; v<=n; v++){
ll sum=0;
for (int u=1; u<=n; u++) sum+=dist[v][u];
ans=min((ll)ans, sum);
}
cout<<ans+n<<'\n';
return 0;
}
