409598: GYM103643 A Meeting Minutes

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

A. Meeting Minutestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

The problem setting team tries to keep weekly meetings to discuss progress etc. Generally, the person who arrives last has to do meeting minutes. Unfortunately, recently regardless of who arrives last, Elijah does the meeting minutes (even if he does not show up to the meeting himself!).

You will be given a list of $$$n$$$, $$$(1 \leq n \leq 100)$$$ names in the order that they arrived to the meeting. Each person's name will be $$$20$$$ characters or less.

You will have to output the person who will do the meeting minutes.

Input

The first line will contain an integer $$$n$$$, $$$(1 \leq n \leq 100)$$$, the number of people who showed up to the meeting. The following $$$n$$$ lines will each contain one name per line, $$$(1 \leq |name| \leq 20)$$$ denoting the name of the person in the order they showed up to the meeting. All names will consist of only of ASCII characters.

Output

You will have to output the person who does the meeting minutes (Elijah!). The output is case sensitive.

ExampleInput
7
Elijah
chessbot
bossologist
chessbot
MantleMoose
NullAwe
SPark
Output
Elijah
Note

Elijah arrives first.

Chessbot shows up second.

Then Bossologist arrives.

Afterwards, chessbot's clone joins the meeting.

MantleMoose arrives after that.

A little after, nullawe who is not in the problem setting team joins.

Finally, SPark dials in.

As per tradition, Elijah has to do the meeting minutes.

$$$---------------------------------------------$$$

Problem idea: 3366

Problem preparation: 3366

Occurrences: Novice 1, Intermediate 1, Advanced 1

加入题单

算法标签: