#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<int>> al(5001, vector<int>()), al2;
vector<ll> sub;
void dfs(int i) {
if (al2[i].empty()) return;
for (int v: al2[i]) {
dfs(v);
sub[i]+=sub[v];
}
}
int main() {
int n; cin>>n;
for (int i=1; i<=n; i++) {
int k; cin>>k;
while (k--) {
int v; cin>>v;
al[v].push_back(i);
}
}
ll ans=1e18;
for (int i=1; i<=n; i++) {
sub.assign(n+1,1);
al2.assign(n+1, vector<int>());
vector<int> vis(n+1,0);
queue<int> q;
q.push(i);
vis[i]=1;
int nvis=1;
while (!q.empty()) {
int u=q.front(); q.pop();
for (int v: al[u]) {
if (vis[v]) continue;
vis[v]=1;
nvis++;
al2[u].push_back(v);
q.push(v);
}
}
if (nvis<n) continue;
dfs(i);
ll s=0;
for (int i=1; i<=n; i++) s+=sub[i];
ans=min(ans,s);
}
cout<<ans;
return 0;
}
