The first line of input has an integer, 2 ≤ N ≤ 32, that identifies the number of pieces of the map that were found.
The following N lines each describe a station depicted on one of those pieces. Each of these lines starts with the name of the station they describe and is followed by a space-separated list of all of the station names that are directly connected to that station (there may be as many as N − 1).
The final line identifies a starting station and a destination station. The destination station is guaranteed to be different than the starting station.
Each station name is a string of up to 20 characters using only letters a–z and A–Z. It is guaranteed that there is at most one simple route (without revisiting stations) from the starting station to the destination station