Judge (2) P63370

To solve this exercise. use the same definitions of problem P14343.

Write a program that reads the submissions done in the Judge, and prints the following information:

• The exercise with more green submissions (the exercise with the smallest identifier in a event of a tie, “-” if there is not any green submission).
• The exercise with more students that have obtained a green (the exercise with the smallest identifier in a event of a tie, “-” if there is not any student with some green exercise).
• The exercise with more students that have tried to solve it and have only obtained reds (the exercise with the smallest identifier in a event of a tie, “-” if there is not any student with any red exercise).
• The exercise that more different students have tried to solve, with or without success (the exercise with the smallest identifier in a event of a tie, “-” if there is not any submission).
• The exercise of the last submission (“-” if there is not any submission).

Input

Input consists of a natural n, followed by n submissions, each one in a line, with the fields in the same order than in the definition of the type. Suppose that there are, at most, 20 students, 50 exercises, and 1000 submissions.

Output

Your program must print the name of the 5 previously said exercises with the corresponding counters, following the format of the instance.

Observation

This exercise is quite long. To compensate, it is not necessary that the sent solution is particularly efficient.