#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}
//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
vll v[N], g[N];
set<ll> s[N];
ll root;
ll dead[N], c[N], p[N], dp[N], used[N];
void dfs(int u, int e)
{
ll sum = 0;
for(auto it : g[u])
{
if(it != e)
{
dfs(it, u);
sum += dp[it];
}
}
dp[u] = sum + 1;
return;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i ++)
{
int x;
cin >> x;
while(x --)
{
ll o;
cin >> o;
v[o].pb(i);
}
}
ll ans = 1e17;
for(int i = 1; i <= n; i ++)
{
queue<int> q;
for(int j = 1; j <= n; j ++)
used[j] = p[j] = dp[j] = 0,
g[j].clear();
q.push(i);
used[i] = 1;
int cnt = 1;
while(!q.empty())
{
int u = q.front();
q.pop();
for(auto it : v[u])
{
if(used[it])
continue;
used[it] = 1;
cnt ++;
q.push(it);
p[it] = u;
if(cnt == n)
break;
}
}
int kil = 0;
for(int j = 1; j <= n; j ++)
kil += (used[j] == 0);
if(kil)
continue;
for(int j = 1; j <= n; j ++)
{
if(j == i) continue;
g[p[j]].pb(j);
g[j].pb(p[j]);
}
dfs(i, 0);
ll res = 0;
for(int j = 1; j <= n; j ++)
res += dp[j];
umin(ans, res);
}
cout << ans;
getchar();
getchar();
return 0;
}
