#include <bits/stdc++.h> #define int long long #define debug cout << "ok\n"; #define SQR(x) (1LL * ((x) * (x))) #define MASK(i) (1LL << (i)) #define BIT(x, i) (((x) >> (i)) & 1) #define fi first #define se second #define pb push_back #define mp make_pair #define pii pair<int,int> #define pli pair<ll,int> #define vi vector<int> #define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef unsigned int ui; using namespace std; const int M = 1e9 + 7; const int INF = 1e9 + 7; const ll INFLL = (ll)2e18 + 7LL; const ld PI = acos(-1); const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1}; const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1}; template<class _, class __> bool minimize(_ &x, const __ y){ if(x > y){ x = y; return true; } else return false; } template<class _, class __> bool maximize(_ &x, const __ y){ if(x < y){ x = y; return true; } else return false; } template<class _,class __> void Add(_ &x, const __ y) { x += y; if (x >= M) { x -= M; } return; } template<class _,class __> void Diff(_ &x, const __ y) { x -= y; if (x < 0) { x += M; } return; } //-------------------------------------------------------------- const int MaxN = 5007; int n,par[MaxN],f[MaxN],g[MaxN],Arr[MaxN]; vi a[MaxN]; int Calc(int root) { for (int i=1;i<=n;i++) par[i] = 0; int _n = 0; par[root] = -1; queue<int> q; q.push(root); while (!q.empty()) { int u = q.front(); q.pop(); Arr[++_n] = u; for (int v : a[u]) { if (par[v] == 0) { par[v] = u; q.push(v); } } } for (int i=1;i<=n;i++) f[i] = 1, g[i] = 0; for (int i=n;i>=1;i--) { int u = Arr[i]; g[u] += f[u]; if (par[u] < 0) continue; int v = par[u]; f[v] += f[u]; g[v] += g[u]; } return g[root]; } void sol() { cin >> n; for (int i=1;i<=n;i++) { int k; cin >> k; while (k--) { int u; cin >> u; a[u].pb(i); } } // debug; int res = INFLL; for (int i=1;i<=n;i++) { minimize(res,Calc(i)); } cout << res; } signed main() { // freopen("test.inp","r",stdin); // freopen("test.out","w",stdout); FAST int t=1; // cin >> t; while (t--) sol(); }