{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch1\u003e\u003c/h1\u003e\n\n\u003cp\u003e\nMr. KM, the mayor of KM city, decided to build a new elementary school.\nThe site for the school has an awkward polygonal shape, which caused several problems.\nThe most serious problem was that there was not enough space for a short distance racetrack.\nYour task is to help Mr. KM to calculate the maximum possible length for the racetrack\nthat can be built in the site.\nThe track can be considered as a straight line segment whose width can be ignored.\nThe boundary of the site has a simple polygonal shape without self-intersection,\nand the track can touch the boundary.\nNote that the boundary might not be convex.\n\u003c/p\u003e\n\n\u003ch2\u003eInput\u003c/h2\u003e\n\n\u003cp\u003e\nThe input consists of multiple test cases, followed by a line containing \"0\".\nEach test case has the following format.\nThe first line contains an integer \u003cvar\u003eN\u003c/var\u003e (\u003cvar\u003e3 \\leq N \\leq 100\u003c/var\u003e).\nEach of the following \u003cvar\u003eN\u003c/var\u003e lines contains two integers \u003cvar\u003ex_i\u003c/var\u003e and \u003cvar\u003ey_i\u003c/var\u003e (\u003cvar\u003e-1,000 \\leq x_i, y_i \\leq 1,000\u003c/var\u003e),\nwhich describe the coordinates of a vertex of the polygonal border of the site, in counterclockwise order.\n\u003c/p\u003e\n\n\u003ch2\u003eOutput\u003c/h2\u003e\n\n\u003cp\u003e\nFor each test case, print its case number and the maximum possible length of the track in a line.\nThe answer should be given as a floating point number with an absolute error of at most \u003cvar\u003e10^{-6}\u003c/var\u003e.\n\u003c/p\u003e\n\n\u003ch2\u003eSample Input\u003c/h2\u003e\n\n\u003cpre\u003e4\n0 0\n10 0\n10 10\n0 10\n3\n0 0\n1 0\n0 1\n0\n\u003c/pre\u003e\n\n\u003ch2\u003eOutput for the Sample Input\u003c/h2\u003e\n\n\u003cpre\u003eCase 1: 14.142135624\nCase 2: 1.41421356\n\u003c/pre\u003e\n"}}]}