#include <bits/stdc++.h>
#define FOR(i,x,n) for(int i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
#define ROF(i,x,n) for(int i=n-1; i>=x; i--)
#define R0F(i,n) ROF(i,0,n)
#define WTF cout << "WTF" << endl
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define F first
#define S second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
const int MAXN = 5000 + 7;
const int ALPHA = 27;
const LL INF = 1e17 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;
int n, m;
LL dist[MAXN];
VI adj[MAXN], ndj[MAXN];
int dp[MAXN];
LL dfs(int now) {
dp[now] = 1;
for(int on : ndj[now])
dp[now] += dfs(on);
return dp[now];
}
LL bfs(int sc) {
fill(dist, dist + n, INF);
F0R(i, n) ndj[i].clear();
dist[sc] = 0;
queue<int> keep;
keep.push(sc);
while(!keep.empty()) {
int now = keep.front();
keep.pop();
for(int on : adj[now]) {
if (dist[on] > dist[now] + 1) {
dist[on] = dist[now] + 1;
keep.push(on);
ndj[now].pb(on);
}
}
}
dfs(sc);
LL sum = 0;
F0R(i, n) sum += dp[i];
LL mx = 0;
F0R(i, n) mx = max(mx, dist[i]);
return (mx == INF ? INF : sum);
}
int main() {
IOS;
cin >> n;
int v;
F0R(i, n) {
int k; cin >> k;
F0R(j, k) {
cin >> v;
adj[--v].pb(i);
}
}
LL ans = INF;
F0R(i, n)
ans = min(ans, bfs(i));
cout << ans;
}
