Welcome to ZOJ
 Problem Sets Information Select Problem Runs Ranklist
ZOJ Problem Set - 1897
Return of the Jedi

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Luke Skywalker races through the forest on a speeder bike, trying to outrun a patrol of Imperial scouts on Endor. A small moon near a new Death Star, Endor is covered by dense foliage and a thick forest of ancient towering trees. The speeder bike , which Luke stole from an Imperial scout, is an antigravity vehicle capable of speeds of 200 miles an hour. How quickly can Luke reach Princess Leia in the Ewok village?

The forest is a plane with T trees. Luke's position is specified by a pair of coordinates (xluke, yluke) within the plane. The Ewok village has coordinates (xewok, yewok). You are to find the shortest travel time from Luke's position to the Ewok village.

Input

The first line of input contains T, xluke, yluke, xewok, yewok. T lines follow; each gives the coordinates and diameter of a tree: xtreei, ytreei, dtreei. T is an integer not exceeding 10; coordinates and diameters are real numbers in miles. Trees do not intersect or touch one another.

Input contains multiple test cases. Process to the end of file.

Output

Output for each test case is a single real number, to two decimal places, giving the minimum travel time in seconds.

Sample Input

2 0.0 0.0 10.0 0.0
4.0 0.0 1.0
6.0 0.0 1.0

Sample Output

181.13

Source: University of Waterloo Local Contest 2002.01.26
Submit    Status