B"Everyone knows that 2010 FIFA World Cup is being held in South Africa now. By the decision of BFA (Berland's Football Association) next World Cup will be held in Berland. BFA took the decision to change some World Cup regulations: You are asked to write a program that, by the given list of the competing teams and the results of all the matches, will find the list of teams that managed to get through to the knockout stage. The first input line contains the only integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950) -- amount of the teams, taking part in the final tournament of World Cup. The following n lines contain the names of these teams, a name is a string of lower-case and upper-case Latin letters, its length doesn't exceed 30 characters. The following n xc2 xb7(n xe2 x80 x89- xe2 x80 x891) xe2 x80 x89/ xe2 x80 x892 lines describe the held matches in the format name1-name2 num1:num2, where name1, name2 -- names of the teams; num1, num2 (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89num1, xe2 x80 x89num2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- amount of the goals, scored by the corresponding teams. Accuracy of the descriptions is guaranteed: there are no two team names coinciding accurate to the letters' case; there is no match, where a team plays with itself; each match is met in the descriptions only once. Output n xe2 x80 x89/ xe2 x80 x892 lines -- names of the teams, which managed to get through to the knockout stage in lexicographical order. Output each name in a separate line. No odd characters (including spaces) are allowed. It's guaranteed that the described regulations help to order the teams without ambiguity."...