Problem: Snuke received a triangle as a birthday present. The coordinates of the three vertices were (x_1, y_1), (x_2, y_2), and (x_3, y_3).

He wants to draw two circles with the same radius inside the triangle such that the two circles do not overlap (but they may touch). Compute the maximum possible radius of the circles.

Constraints

* 0 ≤ x_i, y_i ≤ 1000
* The coordinates are integers.
* The three points are not on the same line.

Input

The input is given from Standard Input in the following format:


x_1 y_1
x_2 y_2
x_3 y_3


Output

Print the maximum possible radius of the circles. The absolute error or the relative error must be at most 10^{-9}.

Examples

Input

0 0
1 1
2 0


Output

0.292893218813


Input

3 1
1 5
4 9


Output

0.889055514217

Solution (in CPP):

Solution:
#include <iostream>
#include <iomanip>
#include <ios> 
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define sz(c) ((int)(c).size())
#define mp make_pair

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef pair<int, int> P;
//typedef pair<int, pair<int, int> > PP;
//const int MAX=;



int main(){
	double x[3], y[3];
	rep(i,3)cin>>x[i]>>y[i];
	double S=abs((x[2]-x[0])*(y[1]-y[0])-(x[1]-x[0])*(y[2]-y[0]))/2;
	
	double l[3];
	l[0]=sqrt((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2]));
	l[1]=sqrt((x[2]-x[0])*(x[2]-x[0])+(y[2]-y[0])*(y[2]-y[0]));
	l[2]=sqrt((x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]));
	double r=2*S/(l[0]+l[1]+l[2]);
	
	double h[3];
	h[0]=(l[1]+l[2]-l[0])/2;
	h[1]=(l[2]+l[0]-l[1])/2;
	h[2]=(l[0]+l[1]-l[2])/2;
	double ans=0;
	rep(i,3){
		double tmp;
		tmp=l[i]*r/(2*r+h[(i+1)%3]+h[(i+2)%3]);
		ans=max(ans, tmp);
	}
	cout<<fixed;
	cout<<setprecision(12)<<ans<<endl;
}