C. Group Movie Night
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

How often has this happened to you: you are trying to plan a group movie night, so you ask your friends if they'd like to join. "Well, I'm really busy with CS429 homework. But maybe if Cooper and Ava also come..."

You are given a list of friends, and for each friend, their dependencies. Each friend will attend the movie night if and only if all of their dependencies also attend.

You also have a list of best friends you definitely want there.

What is the minimum number of people you need to invite to the movie night so that your best friends attend?

Input

The first line of input contains a single integer $$$n$$$ $$$(1 \leq n \leq 100)$$$, the number of potential friends you could invite to the movie night. The next $$$n+1$$$ lines describe you and your friends. Each line begins with a string of between $$$2$$$ and $$$10$$$ ASCII uppercase and lowercase letters; this string is the name of one friend. Then follows an integer $$$k$$$ ($$$0 \leq k \leq n$$$), the number of people on that friend's list of dependencies. The line ends with $$$k$$$ space-separated strings, the names of the friends on the dependency list.

One row starts with the name You. The dependencies of You are the friends you want to be sure attend the movie night.

No two rows start with the same string. Every string in every dependency list is the name of somebody with a row in the input. Nobody is on their own dependency list, and the same name doesn't appear twice on any one dependency list.

Output

Print the minimum number of friends you need to invite (not including You) to guarantee that the people on You's dependency list show up.

Examples
Input
4
Brad 2 Cooper Ava
Cooper 0
Ava 2 Brad You
Annie 2 Brad Cooper
You 1 Brad
Output
3
Input
3
Yingying 2 You Luis
Luis 2 Yingying Mingyu
You 0
Mingyu 1 Luis
Output
0