// author: erray
#include<bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n; ++i) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int x;
cin >> x;
--x;
g[x].push_back(i);
}
}
long long ans = LLONG_MAX;
for (int i = 0; i < n; ++i) {
vector<bool> vis(n);
vector<long long> val(n, 1);
function<long long(int)> dfs = [&](int v) {
vis[v] = true;
for (auto u : g[v]) {
if (vis[u]) continue;
val[v] += dfs(u);
}
return val[v];
};
dfs(i);
ans = min(ans, accumulate(val.begin(), val.end(), 0LL));
}
cout << ans << '\n';
}
