(ssl1720)Surround the Trees(凸包问题，附带新手教程)

Surround the Trees

无责任乱译┑(￣Д ￣)┍：

光头强想种树了树再砍，又怕熊孩子(不是孩子了吧)来捣乱，并打算用绳子把他种的树围起来。但由于他要回家撸猫，便留下了多组数据，每组数据的第一行为树的棵树，剩余为树的坐标，最后n为0时，你就可以回家编程了！

下面为原题：

Description

　　There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal required length of the rope. However, he does not know how to calculate it. Can you help him?
　　The diameter and length of the trees are omitted, which means a tree can be seen as a point. The thickness of the rope is also omitted which means a rope can be seen as a line.

　　There are no more than 100 trees.

Input

　　The input contains one or more data sets. At first line of each input data set is number of trees in this data set, it is followed by series of coordinates of the trees. Each coordinate is a positive integer pair, and each integer is less than 32767. Each pair is separated by blank.

　　Zero at line for number of trees terminates the input for your program.

Output

The minimal length of the rope. The precision should be 10^-2.

Sample Input

9
12 7
24 9
30 5
41 9
80 7 <