In League of Legends, gank is an important way to kill enemies.
The common method is to hide in a underbrush and wait for their arrival.
But the problem is - Not all the underbrush will be appropriate. If one underbrush is the only way which must be passed from one certain underbrush to another certain underbrush, we say it's a 'Dangerous Underbrush'.
Now give you N underbrush and their connectedness. You should tell Garen all the 'Dangerous Underbrush' so that he can hide in it.

You can refer to the picture below:

You should consider that all the underbrush is connected directly or not directly.

This problem contain several cases.
The first line is a integer N. (3 <= N <= 100).
Then follow N lines.
The first integer of ith line Mi indicates the underbrush number of ith underbrush connects directly. (The connections is undirected).
Then follow Mi integers, indicates the each underbrush that the ith underbrush connects with.

For each case, you should find all the 'Dangerous Underbrush', order by identifier increasing. If there's no 'Dangerous Underbrush', then print 'Garen is hapless'.