UTRKA

문제

Numerous local and international recreational runners were eager to take part in this year’s Zagreb Marathon! It is an already traditional race 42 125 meters long. A curious statistical info is that this year every single contestant managed to complete the race, except one.

Since marathons are all about taking part, help the organizers figure out, based on the list of registered contestants and ranking list, the identity of the contestant that did not complete the race.

입력

The first line of input contains the integer N (1 ≤ N ≤ 10⁵), the number of contestants.

Each of the following N lines contains the names of registered contestants.

The additional N−1 lines contain the names of contestants in the order which they completed the race.

The contestants’ names will consist of at least one and at most twenty lowercase letters of the English alphabet.

The contestants’ names won’t necessarily be unique.

출력

The first and only line of output must contain the name of the contestant who didn’t finish the race.

3
leo
kiki
eden
eden
kiki

leo

5
marina
josipa
nikola
vinko
filipa
josipa
filipa
marina
nikola

vinko

4
mislav
stanko
mislav
ana
stanko
ana
mislav

mislav