#include <iostream>
#include <queue>
using namespace std;
vector<int> nei[5005];
long long n, ans = 1e17, seen[505];
void bfs(int s, long long Ans = 0, int ver = 0){
queue<pair<int,int>> Q;
Q.push({s, 1});
seen[s] = s;
while (Q.size() > 0){
auto [u, h] = Q.front();
Q.pop();
Ans += h;
ver++;
for (int i : nei[u]){
if (seen[i] != s)
seen[i] = s, Q.push({i, h + 1});
}
}
if (ver == n)
ans = min(ans, Ans);
}
int main(){
cin>>n;
for (int i=1, k, p;i<=n;i++){
cin>>k;
for (int j=1;j<=k;j++){
cin>>p;
nei[p].push_back(i);
}
}
for (int i=1;i<=n;i++)
bfs(i);
cout<<ans<<'\n';
}
