Can you compute the number of sixth friends in a group of people?
Input
Input consists of several cases. Each case begins with the number of people n, followed by n lines, one per person. Every line i contains the name pi of the i-th person, his number of friends fi, and the names of his fi friends in order, from more to less favorite.
You can assume 1 ≤ n ≤ 104, that all names are different and consist of between 1 and 10 letters, and 0 ≤ fi ≤ 30. The list of friends of each person pi only includes names in {p1, …, pn}, but can contain repeated names, including pi one or more times.
For instance, among the five best friends of Joey in the sample in fact there are only Chandler, Phoebe and Rachel. Janice is the only sixth friend of the first case.
Output
For every case, print the number of sixth friends.
Input
7 Chandler 6 Monica Joey Ross Rachel Phoebe Janice Monica 6 Chandler Monica Rachel Phoebe Joey Janice Janice 3 Janice Chandler Janice Ross 6 Rachel Rachel Rachel Rachel Rachel Janice Rachel 7 Rachel Ross Monica Joey Phoebe Chandler Janice Phoebe 5 Joey Monica Rachel Ross Chandler Joey 8 Chandler Joey Chandler Phoebe Rachel Monica Ross Janice 4 A 3 D D D B 7 B B B B B A A C 0 D 2 D C
Output
1 2