1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<bits/stdc++.h>

#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); 
int n; 
const int MN = 109; 
vi G[MN];  
int wsk[MN];  
bitset <MN> working; 
void read(){ 
	cin >> n; 
	int d, x; 
	for(int i = 1; i <=n ;i++){ 
		cin >> d; 
		for(int j = 0; j < d; j++){ 
			cin >> x; 
			G[i].pb(x);  
		}  
		if(d) working[i] = 1; 
	}
} 
int goodamo; 
void onesearch(){
	int v = 1; int cop; 
	while(working[v]){ 
		if(wsk[v] == 0) 
			goodamo--; 
		if(wsk[v] == sz(G[v])-1)
			goodamo++; 
		cop = G[v][wsk[v]]; 
		wsk[v] = (wsk[v]+1)%sz(G[v]);  
		v = cop; 
	}
}
void running(){ 
	goodamo = n; 
	onesearch(); 
	int wyn =1; 
	while(goodamo != n){ 
		onesearch(); 
		wyn++; 
	} 
	cout << wyn ; 
}
int main(){  
	BOOST
	read(); 
	running(); 
}