Janitor Simulator

Your school classroom cleaning schedule assigns a different student to clean the classroom on each school day. You are given a list of day-to-student assignments. Each day in the given period is assigned exactly once, but the provided assignments may not be in chronological order.
You need to determine two things:

1. How many days each student is assigned to clean.
2. Which student is assigned the most cleaning days. If there is a tie for the most days, choose the student whose name is lexicographically smallest (i.e., comes first in alphabetical order).

Input Format:

The first line contains an integer $N$ ($1 ≤ N ≤ 1000$), the number of cleaning assignments.

Each of the next N lines contains a single days assignment. Each line has:

An integer D ($1 ≤ D ≤ 365$), representing the day number of the school year.

A string $S$, the name of the student assigned to clean on that day.

You may assume that each day number $D$ is unique (no two lines will have the same $D$).

Output Format

First, output the list of students and the number of days they are assigned, sorted by the students name in ascending (alphabetical) order.

Each line should contain the students name, a space, and then their assigned day count.

After listing all students, output a line that starts with

Sample Output 1

Explanation:

• Number of assignments: 5.
• Assignments:
  • Day 10: Alice
  • Day 20: Bob
  • Day 15: Alice
  • Day 25: Charlie
  • Day 30: Alice
• Count of days per student:
  • Alice: 3
  • Bob: 1
  • Charlie: 1
• Most cleaning days: Alice with 3 days.
• Output is sorted alphabetically by student name.

---

Sample Input 2

Sample Output 2

Explanation:

• Number of assignments: 6.
• Assignments:
  • Day 5: Daniel
  • Day 3: Charlie
  • Day 7: Charlie
  • Day 2: Bob
  • Day 4: Alice
  • Day 1: Bob
• Count of days per student:
  • Alice: 1
  • Bob: 2
  • Charlie: 2
  • Daniel: 1
• Most cleaning days:
  • Bob and Charlie both have 2 days, but Bob is lexicographically smaller, so Bob is chosen.
• Output is sorted alphabetically by student name.