//Proud of You//
#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int N = 5e3 + 17;
int n, d[N];
vector <int> adj[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1, m; i <= n; ++i)
{
cin >> m;
for (int j = 1, x; j <= m; ++j)
{
cin >> x;
adj[x].push_back(j);
}
}
int ans = 1e9;
for (int i = 1; i <= n; ++i)
{
fill (d + 1, d + n + 1, N);
queue <int> q;
d[i] = 1;
q.push(i);
while (!q.empty())
{
int u = q.front();
q.pop();
for (int v: adj[u])
{
if (d[v] > d[u] + 1)
{
d[v] = d[u] + 1;
q.push(v);
}
}
}
int z = 0;
for (int i = 1; i <= n; ++i)
{
z += d[i];
}
ans = min (ans, z);
}
cout << ans;
}
