{"raw_statement":[{"iden":"statement","content":"Among participants of programming contests at codeforces.com the following tradition is common: whenever a participant falls in love with another participant, he changes his nickname to «_I_love__». Unfortunately, for technical reasons site administration has lost the current nicknames of participants who had changed their nicknames recently, but the information about who of them fell in love with whom remains. Now the administration needs to write a program for determining the current nickname of the given participant. It should be noted that due to the small bug in the database structure different participants can have the same nicknames on this site.\n\nThe first line contains a single integer n (2 ≤ n ≤ 200000) — the number of participants.\n\nIn the next n lines initial nicknames of participants are given. Each nickname is a non-empty string of length at most 24 characters, consisting only of uppercase and lowercase Latin letters and also underscores. Some nicknames can coincide.\n\nThe next line contains a single integer m (1 ≤ m ≤ 200000) — the number of records that one of the participants fell in love with another participant.\n\nIn the next m lines pairs of integers aj and bj, separated by a space, are given (1 ≤ aj, bj ≤ n, aj ≠ bj) — a record that the aj-th participant fell in love with the bj-th participant and changed his nickname correspondingly. Participants are numbered from one in the order their initial nicknames are given. Renamings occur in the order they are given.\n\nIn the only line output the final nickname of the first participant after all renamings.\n\n"},{"iden":"input","content":"The first line contains a single integer n (2 ≤ n ≤ 200000) — the number of participants.In the next n lines initial nicknames of participants are given. Each nickname is a non-empty string of length at most 24 characters, consisting only of uppercase and lowercase Latin letters and also underscores. Some nicknames can coincide.The next line contains a single integer m (1 ≤ m ≤ 200000) — the number of records that one of the participants fell in love with another participant.In the next m lines pairs of integers aj and bj, separated by a space, are given (1 ≤ aj, bj ≤ n, aj ≠ bj) — a record that the aj-th participant fell in love with the bj-th participant and changed his nickname correspondingly. Participants are numbered from one in the order their initial nicknames are given. Renamings occur in the order they are given."},{"iden":"output","content":"In the only line output the final nickname of the first participant after all renamings."},{"iden":"examples","content":"Input5anonymousnataliaLeBronTanya_RomanovaMikeMirzayanov61 23 42 14 31 43 2OutputI_love_I_love_I_love_Tanya_RomanovaInput5anonymousnataliaLeBronTanya_RomanovaMikeMirzayanov32 11 21 5OutputI_love_MikeMirzayanovInput2MikhailRubinchikevol_I11 2OutputI_love_evol_I"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of supervisors.  \nLet $ m \\in \\mathbb{Z}^+ $ be the number of graduation project groups.\n\n**Constraints**  \n$ 1 \\leq n, m \\leq 10^3 $\n\n**Objective**  \nDetermine whether $ n \\mid m $, i.e., whether $ m $ is divisible by $ n $.  \nIf yes, output \"YES\"; otherwise, output \"NO\".","simple_statement":"Given n supervisors and m groups, can you divide the groups equally so each supervisor gets the same number of groups? Print \"YES\" if yes, \"NO\" if no.","has_page_source":false}