{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_epigraph\"\u003e— Oh, Boss, I can see you!\u003cbr\u003e\r\n— Analogously!\u003cbr\u003e \r\nFrom the animated film \u0027Investigation Held by Kolobki\u0027\r\n\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eDuring their investigation, detectives Boss and Colleague got into an \r\nempty warehouse to look for evidence of crime. The warehouse is \r\na polygon without self-intersections and self-tangencies,\r\nnot necessarily convex. The detectives investigate the territory of \r\nwarehouse in such a way that each of them can always see the other one.\r\nBoss and Colleague can see each other if all the points of a segment \r\nconnecting them lie either inside the warehouse or on its border.\r\nFind the maximal possible distance between the detectives.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line of input contains an integer \u003ci\u003en\u003c/i\u003e: the number of vertices\r\nof the polygon (3 ≤ \u003ci\u003en\u003c/i\u003e ≤ 200).\r\nNext \u003ci\u003en\u003c/i\u003e lines contain two integers \u003ci\u003ex\u003c/i\u003e\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ey\u003c/i\u003e\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e each: coordinates\r\nof vertices in clockwise or counterclockwise order\r\n(−1000 ≤ \u003ci\u003ex\u003c/i\u003e\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ey\u003c/i\u003e\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e ≤ 1000).\r\nIt is guaranteed that polygon has neither self-intersections\r\nnor self-tangencies.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the maximal possible distance between Boss and Colleague.\r\nThe answer must be given with absolute or relative error\r\nnot exceeding 10\u003csup\u003e−6\u003c/sup\u003e.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4\r\n0 0\r\n0 1\r\n1 1\r\n1 0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1.414214\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}