#include <bits/stdc++.h>
using namespace std;
#define name "bosses"
#define MAXN 5003
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(ll &u, ll v){
u=min(u,v);
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int n;
vector<int> adj[MAXN],g[MAXN];
bool visited[MAXN];
queue<int> Q;
int dp[MAXN];
ll ans=1e18;
void dfs(int u){
dp[u]=0;
for (int v:g[u]){
dfs(v);
dp[u]+=dp[v];
}
++dp[u];
}
void bfs(int s){
FOR(i,1,n) visited[i]=0;
FOR(i,1,n) g[i].clear();
visited[s]=1;
Q.push(s);
while (Q.size()){
int u=Q.front();
Q.pop();
for (int v:adj[u]){
if (!visited[v]){
visited[v]=1;
Q.push(v);
g[u].pb(v);
}
}
}
FOR(i,1,n) if (!visited[i]) return;
dfs(s);
ll cur=0;
FOR(i,1,n) cur+=1LL*dp[i];
minimize(ans,cur);
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n;
FOR(i,1,n){
int k;
cin>>k;
FOR(j,1,k){
int x;
cin>>x;
adj[x].pb(i);
}
}
FOR(i,1,n){
bfs(i);
}
cout<<ans;
return 0;
}
