{"raw_statement":[{"iden":"problem statement","content":"Given are $N$ points $(x_i, y_i)$ in a two-dimensional plane.\nFind the minimum radius of a circle such that all the points are inside or on it."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 50$\n*   $0 \\leq x_i \\leq 1000$\n*   $0 \\leq y_i \\leq 1000$\n*   The given $N$ points are all different.\n*   The values in input are all integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$x_1$ $y_1$\n$:$\n$x_N$ $y_N$"},{"iden":"sample input 1","content":"2\n0 0\n1 0"},{"iden":"sample output 1","content":"0.500000000000000000\n\nBoth points are contained in the circle centered at $(0.5,0)$ with a radius of $0.5$."},{"iden":"sample input 2","content":"3\n0 0\n0 1\n1 0"},{"iden":"sample output 2","content":"0.707106781186497524"},{"iden":"sample input 3","content":"10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9"},{"iden":"sample output 3","content":"6.726812023536805158\n\nIf the absolute or relative error from our answer is at most $10^{-6}$, the output will be considered correct."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}