#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
vector<vector<int>>adj;
int n , m , k , q ,s, t;
int cal(int scr){
vector<int>dis(n+1,inf);
dis[scr] = 1;
queue<int>Q;
Q.push(scr);
while(Q.size()){
int c = Q.front();
Q.pop();
for(int i:adj[c]){
if(dis[i] > dis[c]+1){
dis[i] = dis[c]+1;
Q.push(i);
}
}
}
int ans = 0;
for(int i = 1;i<=n;i++){ ans+=dis[i];ans = min(ans,inf);}
return ans;
}
void solve(int testcase_number){
cin>>n;
adj.resize(n+1);
for(int i=0 ;i<n;i++){
int sz;cin>>sz;
for(int j = 0;j<sz;j++){
cin>>s;
adj[s].pb(i+1);
}
}
int ans = inf;
for(int i = 1;i<=n;i++){
ans = min(ans,cal(i));
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
