#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define sz(v) int((v).size())
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
int mod = 1e9+7;
ll modulo(ll a) {
return ((a % mod) + mod) % mod;
}
ll add(ll a, ll b) {
return modulo(a + b);
}
ll mult(ll a, ll b) {
return modulo(a * b);
}
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b&1) {
res = mult(res, a);
}
a = mult(a, a);
b >>= 1;
}
return res;
}
ll dfs(int v, int p, vector <vector <int>> &graph, ll &sum) {
ll total = 1;
for (auto to : graph[v]) {
if (to == p) continue;
total += dfs(to, v, graph, sum);
}
sum += total;
return total;
}
ll bfs(int v, int n, vector <vector <int>> &graph) {
vector <vector <int>> hierarchy(n+1);
vector <int> dist(n+1, 2e9);
dist[v] = 0;
queue <int> K;
K.push(v);
while (!K.empty()) {
auto u = K.front(); K.pop();
for (auto to : graph[u]) {
if (dist[to] > dist[u] + 1) {
hierarchy[u].pb(to);
hierarchy[to].pb(u);
dist[to] = dist[u] + 1;
K.push(to);
}
}
}
ll sum = 0;
dfs(v, v, hierarchy, sum);
return sum;
}
void solve() {
int n;
cin >> n;
vector <vector <int>> graph(n+1);
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
graph[x].pb(i);
}
}
ll ans = 9e18;
for (int i = 1; i <= n; i++) {
ans = min(ans, bfs(i, n, graph));
}
cout << ans;
}
int main() {
do_not_disturb
int t = 1;
//~ cin >> t;
while (t--) {
solve();
}
return 0;
}
