1 \(s / 64\) \(MB / 50\) points

After having watched all eight Harry Potter movies in a week, Nikola 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\) .

Nikola is now wondering what would happen if 26 wizards labeled 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:
1.
Which wizard did the wand obey after all \(N\) duels?
2.
How many different wizards did the wand obey?

Correct answer to the first question is worth 2 points and the correct answer to the second question is

worth 3 points. If you do not know how to solve some part of the task, then print any value in the

corresponding line.

1 \(s / 64\) \(MB / 50\) points

The first line contains an uppercase letter of the English alphabet, the label of the wizard that the

wand obeyed at the beginning.
The second line contains an integer number \(N\) (1 ≤ \(N \le 100\)), the number of duels from the text of the

task.
In the next \(N\) rows there are two different uppercase letters of the English alphabet Z1 and Z2

separated by a space, whereas the wizard with the label Z1 defeated the wizard with the label Z2 in

the i ^{th}{ } duel.

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.

생성자가 기록되지 않았습니다.

출처 COCI 2018/2019 Contest 4