You are an expert competitive programmer. You will be given a problem statement, test case constraints and example test inputs and outputs. Please reason step by step about the solution (that must respect memory and time limits), then provide a complete implementation in c++17.

Your solution must read input from standard input (cin), write output to standard output (cout).
Do not include any debug prints or additional output.

Put your final solution within a single code block:
```cpp
<your code here>
```

Execution time limit: 4.0 seconds
Memory limit: 256.0 MB

# Problem
After a long time living abroad, you have decided to move back to Italy and have to find a place to live, but things are not so easy due to the ongoing global pandemic.

Your three friends Fabio, Flavio and Francesco live at the points with coordinates $$$(x_1, y_1), (x_2, y_2)$$$ and $$$(x_3, y_3)$$$, respectively. Due to the mobility restrictions in response to the pandemic, meetings are limited to $$$3$$$ persons, so you will only be able to meet $$$2$$$ of your friends at a time. Moreover, in order to contain the spread of the infection, the authorities have imposed the following additional measure: for each meeting, the sum of the lengths travelled by each of the attendees from their residence place to the place of the meeting must not exceed $$$r$$$.

What is the minimum value of $$$r$$$ (which can be any nonnegative real number) for which there exists a place of residence that allows you to hold the three possible meetings involving you and two of your friends? Note that the chosen place of residence need not have integer coordinates.

## Input Format
The first line contains the two integers $$$x_1, y_1$$$ ($$$-10^4 \le x_1, y_1 \le 10^4$$$) — the coordinates of the house of your friend Fabio.

The second line contains the two integers $$$x_2, y_2$$$ ($$$-10^4 \le x_2, y_2 \le 10^4$$$) — the coordinates of the house of your friend Flavio.

The third line contains the two integers $$$x_3, y_3$$$ ($$$-10^4 \le x_3, y_3 \le 10^4$$$) — the coordinates of the house of your friend Francesco.

It is guaranteed that your three friends live in different places (i.e., the three points $$$(x_1, y_1)$$$, $$$(x_2, y_2)$$$, $$$(x_3, y_3)$$$ are guaranteed to be distinct).

## Output Format
Print the minimum value of $$$r$$$ which allows you to find a residence place satisfying the above conditions. Your answer is considered correct if its absolute or relative error does not exceed $$$10^{-4}$$$.

Formally, let your answer be $$$a$$$, and the jury's answer be $$$b$$$. Your answer is accepted if and only if $$$\frac{|a - b|}{\max{(1, |b|)}} \le 10^{-4}$$$.

## Examples
```input
0 0
5 0
3 3
```
```output
5.0686143166
```
-----
```input
-1 0
0 0
1 0
```
```output
2.0000000000
```

## Note
In the first sample, Fabio, Flavio and Francesco live at the points with coordinates $$$(0,0)$$$, $$$(5,0)$$$ and $$$(3,3)$$$ respectively. The optimal place of residence, represented by a green house in the picture below, is at the point with coordinates $$$(2.3842..., 0.4151...)$$$.

In the second sample, any point on the segment $$$\{(x,0):\ -1 \leq x \leq 1 \}$$$ is an optimal place of residence.

Now solve the problem and return the code.