Description

As the days grow shorter and the nights longer, we must consider the problem of snowplowing. All roads in the city are dual-lane, but due to budget cuts, the city has only one snowplow. The snowplow can only clear the snow from the lanes it travels, and wherever there is snow, the snowplow must depart from its parking location to traverse all the city's streets. The question now is: What is the minimum time required to clear the snow from all the roads?

Input Format

The first line of the input data indicates the parking coordinates (x, y) of the snowplow, where x and y are integers in meters.

The following lines, up to a maximum of 100, provide the start and end coordinates of each street. All streets are straight and consist of two one-way lanes. The snowplow can make any turn at intersections or at the ends of streets, including U-turns. The snowplow travels at 20 km/h when clearing snow and at 50 km/h when not clearing snow.

It is guaranteed that the snowplow can reach any street from its starting point.

Output Format

The minimum time required to clear all the streets and return to the starting point, rounded to the nearest minute.

0 0
0 0 10000 10000
5000 -10000 5000 10000
5000 10000 10000 10000

3:55

Hint

【Note】
3 hours and 55 minutes