/*
* author : Apiram
* created: 27.06.2023 03:25:28
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<vector<int>>adj(n);
for (int i = 0;i<n;++i){
int k;cin>>k;
for (int j = 0;j<k;++j){
int x;cin>>x;
--x;
adj[x].push_back(i);
}
}
int pos = n + 1;
for (int i = 0;i<n;++i){
priority_queue<pair<int,int>>q;
int curv = 1;
int ans = 0;
vector<int>visited(n,false);
visited[i] = true;
q.push({0,i});
while(!q.empty()){
auto u = q.top();
q.pop();
ans = max(ans,-u.first);
for (auto x:adj[u.second]){
if (!visited[x]){
visited[x] = true;
q.push({-(-u.first + 1),x});
curv++;
}
}
}
if (curv == n){
pos = min(pos,ans);
}
}
cout<<pos * 2 + n<<'\n';
return 0;
}
