#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//https://quera.org/profile/4dykhk
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 5e3 + 23;
const int sq = 450;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 5e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define pb push_back
#define ms(x,y) memset((x) , (y) , sizeof (x))
#define done return cout<<endl , 0;
#define kill(x) cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pc(x) __builtin_popcount(x)
#define ctz(x) __builtin_ctz(x)
#define MinHeap(x) priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x) priority_queue<x, vector<x>>
#define lc (v << 1)
#define rc ((v<<1) |1)
#define int ll
ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
int n;
int h[N];
int ans = inf;
vector<int> G[N];
queue<int> Q;
bool mark[N];
void bfs(int s) {
ms(mark,0);
h[s] = 1;
mark[s] = true;
Q.push(s);
int javab = 0;
while(sz(Q)) {
int v = Q.front(); Q.pop();
javab += h[v];
for(int u : G[v]) if(!mark[u]) {
h[u] = h[v] + 1;
mark[u] = true;
Q.push(u);
}
}
for(int i =1; i<= n ; i++) if(!mark[i]) return;
ans =min(ans,javab);
}
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin>>n;
for(int i = 1; i<= n ;i ++) {
int k; cin>>k;
for(int j= 1; j<= k ; j++) {
int x; cin>>x;
G[x].pb(i);
}
}
for(int i =1; i<= n ; i++) {
bfs(i);
}
cout<<ans;
done;
}
