The Goal

Limits: 2 sec., 256 MiB

You favorite football team just scored a goal. All the players (except of the goalkeeper) would like to get together and hug each other. We consider players to be points on the plain. All the players move with the same speed that is one unit of distance per one unit of time. You have to find minimal possible time they need to get together.

Input

You are given 10 lines. Each line contains two integers \(X_j\) and \(Y_j\) separated with a single space. Here (\(X_j\), \(Y_j\)) are coordinates of the \(j\)-th player.

Output

The minimal time required with absolute or relative error not exceeding \(10^{-4}\).

Constraints

\(-1000 \le X_j, Y_j \le 1000\).

Samples