#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5005;
vector<int> g[N];
int a[N];
void dfs(int u) {
a[u] = 1;
for (int v : g[u]) {
if (a[v]) {
continue;
}
dfs(v);
a[u] += a[v];
}
}
void run() {
int n;
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++) {
fill_n(a, n + 1, 0);
dfs(i);
if (a[i] != n) {
continue;
}
ans = min(ans, accumulate(a + 1, a + n + 1, 0ll));
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
int t = 1;
while (t--) {
run();
}
}
