#K83142. Badge Distribution

    ID: 36132 Type: Default 1000ms 256MiB

Badge Distribution

Badge Distribution

You are given the number of participants and a list of their names. Your task is to assign each participant a unique badge number based on the alphabetical order of their names. The smallest name in alphabetical order will receive badge 1, the next will receive badge 2, and so on.

Note: The input will be provided via standard input (stdin) and the output must be printed to standard output (stdout). Each line of the output should contain the participant's name followed by their badge number, separated by a single space.

Example:

Input:
5
hiro akiko takashi kenta yumi

Output: akiko 1 hiro 2 kenta 3 takashi 4 yumi 5

</p>

The solution is expected to work for any valid list of names adhering to the input format provided.

inputFormat

The first line contains an integer n, representing the number of participants. The second line contains n space-separated strings, each representing a participant's name.

Input Format:

 n
 name1 name2 ... nameN

outputFormat

Print n lines. Each line should contain a participant's name and the assigned badge number (starting from 1) separated by a space. The participants must be printed in alphabetical order.

## sample
5
hiro akiko takashi kenta yumi
akiko 1

hiro 2 kenta 3 takashi 4 yumi 5

</p>