#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5005;
vector<int> g[N], h[N];
int a[N], n;
void dfs(int u) {
for (int v : h[u]) {
dfs(v);
a[u] += a[v];
}
}
int bfs(int s) {
for (int i = 1; i <= n; i++) {
a[i] = 0;
h[i].clear();
}
queue<int> q;
q.push(s);
a[s] = 1;
while (q.size()) {
int u = q.front();
q.pop();
for (int v : g[u]) {
if (!a[v]) {
a[v] = 1;
h[u].push_back(v);
q.push(v);
}
}
}
dfs(s);
for (int i = 1; i <= n; i++) {
if (!a[i]) {
return 1e18;
}
}
return accumulate(a + 1, a + n + 1, 0ll);
}
void run() {
cin >> n;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
while (k--) {
int j;
cin >> j;
g[j].push_back(i);
}
}
int ans = 1e18;
for (int i = 1; i <= n; i++) {
ans = min(ans, bfs(i));
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
int t = 1;
while (t--) {
run();
}
}
