autobus (COCI CONTEST_#3)
Time limit: 1 seconds | Memory limit: 512 MB | Task type: batch
Algorithms: brute force, sorting, two pointers

# Task Autobus

Mr. Malnar decided to visit one of the few cities he has not yet visited, Wroclaw (Pol. Wrocław), located in the southwest of Poland. Since he hadn't traveled by bus for a long time, he missed the experience; however, he was disappointed to learn that there is no direct bus line between Zagreb and Wroclaw.

The best alternative is transferring in the Austrian city of Graz. Mr. Malnar found a timetable, i.e., a list of bus lines operating on the routes Zagreb-Graz and Graz-Wroclaw. A bus on a specific route runs daily, departing exactly at the start of the departure time minute and arriving precisely at the end of the last minute of the arrival time. The time required for transferring is negligible, i.e., it is possible to board a bus if you arrive at the destination before the bus you wish to transfer to departs (the arrival time of the first bus must be strictly less than the departure time of the second bus).

Determine the shortest time required to travel from Zagreb to Wroclaw.

## Input

The first line contains a positive integer $n$ ($1 \le n \le 200$), the number of bus lines.

In the next $n$ lines, the names of two cities connected by the symbol \"-\" are given in order, the first representing the departure city and the second the destination city, followed by the departure time and arrival time in the format `h:mm--h:mm`, where `h` represents the hours, and `mm` represents the minutes of that time. Note that two digits for minutes will always be shown. If the number of minutes is a single digit, a leading zero will be included. It is guaranteed that each trip (without transfers) will last at most 24 hours.

## Output

If it is possible to travel from Zagreb to Wroclaw, print the travel time in the first line in the format `h:mm` (described above).

If it is not possible, print "NEMOGUCE" (without quotes, Croatian for "IMPOSSIBLE") in the first line.

## Scoring

| Subtask | Points | Constraints                                             |
|---------|--------|---------------------------------------------------------|
| 1       | 9      | $n \le 3$                                               |
| 2       | 19     | There exists exactly one bus line on route Zagreb-Graz. |
| 3       | 22     | No additional constraints.                              |

## Examples

**Input:**

```
4
Zagreb-Graz 15:30--23:59
Graz-Wroclaw 10:42--19:15
Zagreb-Graz 14:13--20:19
Graz-Wroclaw 2:25--5:00
```

**Output:**

```
13:31
```

**Input:**

```
3
Zagreb-Graz 6:05--16:40
Zagreb-Graz 20:00--21:40
Zagreb-Graz 9:56--22:36
```

**Output:**

```
NEMOGUCE

Starter code:

Grader code:

Setup script:

Evaluation script: