#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;
vector<vi> adj;
vector<bool> vis;
vi a;
int n;
vi child;
vi par, layer;
bool bfs(int x){
par[x] = x;
queue<pi> q;
q.push({x, 0});
vis[x] = true;
while(!q.empty()){
auto [u, i] = q.front();
layer[u] = i;
child[u] = 0;
q.pop();
trav(v, adj[u]){
if(!vis[v]){
vis[v] = true;
par[v] = u;
child[u]++;
q.push({v, i + 1});
}
}
}
F0R(i, n) if(!vis[i])
return false;
vector<vi> pq(n);
F0R(i, n){
if(child[i] == 0){
pq[layer[i]].pb(i);
vis[i] = false;
}
}
F0Rd(i, n){
trav(j, pq[i]){
if(par[j] == j)
continue;
a[par[j]] += a[j];
if(vis[par[j]] == true)
pq[layer[par[i]]].pb(par[i]), vis[par[i]] = false;
}
}
return true;
}
void solve(){
cin >> n;
adj.resize(n);
vis.resize(n);
child.resize(n);
par.resize(n);
layer.resize(n);
a.resize(n);
F0R(i, n){
int x; cin >> x;
F0R(j, x){
int a;
cin >> a;
a--;
adj[a].pb(i);
}
}
int mn = 1e9;
F0R(i, n){
vis.assign(n, false);
a.assign(n, 1);
if(!bfs(i)) continue;
mn = min(mn, accumulate(all(a), 0));
}
cout << mn << nl;
}
int32_t main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int TC = 1;
// cin >> TC;
while(TC--){
solve();
}
return 0;
}
