#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
void solve(){
int n; cin >> n;
vector <int> adj[n + 1];
for (int i = 1; i <= n; i++) {
int s; cin >> s;
while (s--) {
int u; cin >> u;
adj[u].emb(i);
}
}
int ans = inf;
for (int root = 1; root <= n; root++) {
queue <int> q; q.emplace(root);
vector <bool> visited(n + 1); visited[root] = 1;
vector <int> depth(n + 1); depth[root] = 1;
int cnt = 0;
while (!q.empty()) {
auto u = q.front(); q.pop();
cnt++;
for (auto v : adj[u]) {
if (visited[v]) continue;
q.emplace(v);
depth[v] = depth[u] + 1;
visited[v] = 1;
}
}
if (cnt == n) ans = min(ans, accumulate(all(depth), 0ll));
}
cout << ans;
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
