You are the friend of someone. You realize the truth about the sensor network from the question sheet of CPT final exam, which you’re reading right now. You decide to help your best friend, someone. You go to threaten Dao Dan to hand in the data sheet of the sensor network. (Yes, the gossip king is Dao Dan’s 3rd identities. He knows everything you want to know.) You decide to use the fence with the shortest length to surround the sensors all together in one region. Then, tell someone not to enter the region. As the best friend of someone, you should let him pay for the fence. Please output the length of shortest fence times 5 (unit price of the wood) times 10 (unit price of friendship).
Each test case starts with a line containing one integers n(1<=n<=105) indicating the number of sensors on the campus. Following this are n lines, each containing 2 integers representing the position of the sensor xi, yi (|xi|,|yi|<=107).
Please output the price of the fence, which is equal to the length of the fence times 50.