After having watched all eight Harry Potter movies in a week, Fito finally realized how the famous
Elder Wand changes the wizard it obeys. If wizard A, whom the wand is currently obeying, is
defeated by wizard B in a duel, then the wand will start obeying the wizard B.

Fito is now wondering what would happen if 26 wizards labelled with upper case letters of the
English alphabet from "A" to "Z" began fighting in duels for the fondness of the Elder Wand. If we
know the label of the wizard that the wand had obeyed before all duels and the outcomes of all N duels that were held one after another, answer the following questions:
- Which wizard did the wand obey after all N duels?
- How many different wizards did the wand obey?
Output
In the first line print an uppercase letter of the English alphabet, answer to the first question from the
task description.
In the second line print an integer number, answer to the second question from the task description