#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int n, vis[N];
vector<int> adj[N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 1;i<=n;i++){
int k; cin >> k;
for(int j = 0;j<k;j++){
int u; cin >> u;
adj[u].push_back(i);
}
}
int ans = INT_MAX;
for(int i = 1;i<=n;i++){
memset(vis, 0, sizeof vis);
queue<int> q;
vector<int> dist(n + 1, -1);
q.push(i);
dist[i] = 1;
while(!q.empty()){
int u = q.front();
q.pop();
for(auto v : adj[u]){
if(dist[v] == -1){
dist[v] = dist[u] + 1;
q.push(v);
}
}
}
bool ok = 1;
int sm = 0;
for(int i = 1;i<=n;i++){
ok &= (dist[i] != -1);
sm += dist[i];
}
if(ok) ans = min(ans, sm);
}
cout << ans;
}
