Snow Plowing

Special for beginners, ^_^

Problem Description

As the days grow shorter and the nights longer, we have to start thinking about snow removal. Every road in the city has two lanes. Because of budget cuts, the whole city owns only one snow plow. The plow can only clear the snow from the lanes it drives over. Wherever there is snow, the plow must start from where it is parked and travel through all the city's streets. The question is: what is the minimum time needed to clear all the roads?

Input Format

The first line of input gives the parking coordinates $(x,y)$ of the snow plow, where $x,y$ are integers measured in meters. Up to $100$ lines follow; each gives the start coordinates and end coordinates of one street. All streets are straight, and each has one lane in each direction. The plow may turn at any intersection or at either end of any street, including making a $U$-turn. The plow moves forward at $20$ km/h while plowing snow, and at $50$ km/h when it is not plowing.

It is guaranteed that the plow can reach every street from its starting point.

Output Format

The minimum time needed to clear all streets and return to the starting point, accurate to the minute, with the minute part occupying 2 integer digits.

Sample Input 1

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

Sample Output 1

3:55

Constraints

1s, 1024KiB for each test case.