H. Table Bowlingtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputTable bowling tournament participant completed the competition according to the given final standings table. The table is given as a sequence of lines, each line has a format "name score". Your task is to prepare another table consisting of lines in the form "place name". Sort participant by score (desc.) and by the name lexicographically in the case of a tie. Places are numerated from 1. If more than one participant has some score, all of them share the places and you should output something like "12-14 john".Please, look into the samples for clarification.InputThe first line contains n (1 ≤ n ≤ 100) — the number of rows in the table. Following n lines contain the given table. Each line has the form "name score", where "name" is a sequence of lowercase Latin letters, and "score" — is an integer number between 0 and 1000, inclusive. All the names are distinct. The length of each name is between 1 and 10 characters, inclusive. There is single space between the name and the score in each line.OutputPrint the required table. Look at the sample outputs for clarifications.ExamplesInput5vasya 10ted 11petya 10katya 33mike 44Output1 mike2 katya3 ted4-5 petya4-5 vasyaInput3a 1b 13c 1Output1 b2-3 a2-3 c
Input5vasya 10ted 11petya 10katya 33mike 44
Output1 mike2 katya3 ted4-5 petya4-5 vasya
['*special problem', 'sortings', '*2300']