{"raw_statement":[{"iden":"problem statement","content":"There are $N$ points in a two-dimensional plane. The coordinates of the $i$\\-th point are $(x_i,y_i)$.\nFind the maximum length of a segment connecting two of these points."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 100$\n*   $-1000 \\leq x_i,y_i \\leq 1000$\n*   $(x_i,y_i) \\neq (x_j,y_j)\\ (i \\neq j)$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$x_1$ $y_1$\n$x_2$ $y_2$\n$\\hspace{0.4cm} \\vdots$\n$x_N$ $y_N$"},{"iden":"sample input 1","content":"3\n0 0\n0 1\n1 1"},{"iden":"sample output 1","content":"1.4142135624\n\nFor the $1$\\-st and $3$\\-rd points, the length of the segment connecting them is $\\sqrt 2 = 1.41421356237\\dots$, which is the maximum length."},{"iden":"sample input 2","content":"5\n315 271\n-2 -621\n-205 -511\n-952 482\n165 463"},{"iden":"sample output 2","content":"1455.7159750446"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}