Maximum Simultaneous Attendees at the Summit

You are given the schedule of several attendees at a summit. Each attendee's schedule is provided as a time interval in the format (hh:mm-hh:mm). Your task is to determine the maximum number of attendees present at the summit at the same time.

In other words, given (n) time intervals, where each interval represents the time during which an attendee is present, compute the maximum number of overlaps among these intervals.

Note that if an attendee leaves at a given time and another arrives at the same time, the departure is considered to occur before the arrival.

inputFormat

The input is read from standard input (stdin). The first line contains an integer (n), the number of attendees. Each of the following (n) lines contains a string in the format (hh:mm-hh:mm), representing the arrival and departure times of an attendee.

outputFormat

Output the maximum number of attendees present at the summit at any one time to standard output (stdout).## sample

5
09:00-11:00
10:00-12:00
11:00-13:00
10:30-11:30
12:00-13:30

3