#include<bits/stdc++.h>
using namespace std;
using lint = int64_t;
const int mod = 998244353;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x_=0, T y_=0) : x(x_), y(y_) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
};
using P = Point<double>;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
	vector<P>pnt1(4), pnt2(4);
	double h1, h2;
	cin>>pnt1[0].x>>pnt1[0].y>>pnt1[1].x>>pnt1[1].y>>h1;
	cin>>pnt2[0].x>>pnt2[0].y>>pnt2[1].x>>pnt2[1].y>>h2;
	for(int i=2;i<4;i++){
		pnt1[i] = pnt1[i-1] + (pnt1[i-1] - pnt1[i-2]).perp();
		pnt2[i] = pnt2[i-1] + (pnt2[i-1] - pnt2[i-2]).perp();
	}
	double l1 = (pnt1[1] - pnt1[0]).dist();
	double l2 = (pnt2[1] - pnt2[0]).dist();
	double d1 = sqrt(h1 * h1 + l1 * l1 / 4);
	double d2 = sqrt(h2 * h2 + l2 * l2 / 4);

	double ans = 1e9;
	for(int i=0;i<4;i++){
		P m1 = (pnt1[i] + pnt1[(i+1)%4]) / 2;
		P o1 = m1 + (pnt1[(i+1)%4] - pnt1[i]).normal() * d1;
		for(int j=0;j<4;j++){
			P m2 = (pnt2[j] + pnt2[(j+1)%4]) / 2;
			P o2 = m2 + (pnt2[(j+1)%4] - pnt2[j]).normal() * d2;
			double lo1 = 0, hi1 = 1;
			auto f = [&](double mid1)->double {
				P cur1 = pnt1[i] + (pnt1[(i+1)%4] - pnt1[i]) * mid1;
				double lo2 = 0, hi2 = 1;
				auto g = [&](double mid2)->double {
					P cur2 = pnt2[j] + (pnt2[(j+1)%4] - pnt2[j]) * mid2;
					return (cur1 - o1).dist() + (cur2 - cur1).dist() + (o2 - cur2).dist();
				};
				for(int z2=0;z2<100;z2++){
					double m1 = 2 * lo2/3 + hi2/3;
					double m2 = lo2/3 + 2 * hi2/3;
					if(g(m1) < g(m2)) hi2 = m2;
					else lo2 = m1;
				}
				return g(lo2);
			};
			for(int z1=0;z1<100;z1++){
				double m1 = 2 * lo1/3 + hi1/3;
				double m2 = lo1/3 + 2 * hi1/3;
				if(f(m1) < f(m2)) hi1 = m2;
				else lo1 = m1;
			}
			ans = min(ans, f(lo1));
		}
	}
	cout<<fixed<<setprecision(9);
	cout<<ans<<"\n";
    return 0;
}