Alicia is staying in a hotel on the edge of town. She sets out in the morning with a list of landmarks to visit all across the city. This day of sightseeing will take her through the city, visiting a number of locations, all the way to the far-side of city where she will pause for lunch at the prestigious Pete’s Polygon Pizza Parlour. Anything she misses must be visited on the return trip to the hotel in the evening.

Given the set of locations that Alicia would like to visit, find the length of the shortest tour which starts at her hotel, visits each of the locations, and returns back to the hotel. Beside the starting location, each location should be visited exactly once.

The starting hotel will be located at the leftmost x-coordinate. From there, the optimal path should visit locations at strictly increasing x-coordinates until Pete’s Parlour is reached at the rightmost x-coordinate. From here, the optimal return path should visit any and all unseen locations in strictly decreasing x-coordinates.

Note that the x-coordinate of each location will be unique.

Input

The first line of input contains a single integer N, 1 ≤ N ≤ 1000, representing the number of locations.

Each of the next n lines contains two integers X and Y, 0 ≤ X, Y ≤ 100000, representing the coordinates of the N locations.

The (X, Y) coordinates of all locations are given as integers on a Euclidean plane.

Output

The output should consist of a single decimal containing the the total length of the tour rounded to two decimal places. This should immediately be followed by a newline.

Example One

Input:
5 
1 3
2 1
3 4
4 4
5 2

Output:
10.87

Example Two

Input:
10
4 1
13 4
21 3
25 9
28 10
42 1
43 2
50 4
67 10
68 9

Output:
131.65