#include <bits/stdc++.h>
using namespace std;

typedef long double db;
const db eps=1e-8;
const db INF=1e18;
int sign(db k){
    if (k>eps) return 1;
    else if (k<-eps) return -1;
    return 0;
}
int cmp(db k1,db k2){return sign(k1-k2);}
int inmid(db k1,db k2,db k3){return sign(k1-k3)*sign(k2-k3)<=0;}

struct point{
    db x,y;
    point operator + (const point &k1) const{return (point){x+k1.x,y+k1.y};}
    point operator - (const point &k1) const{return (point){x-k1.x,y-k1.y};}
    point operator * (db k1) const{return (point){x*k1,y*k1};}
    point operator / (db k1) const{return (point){x/k1,y/k1};}
    point turn90(){
        return (point){-y,x};
    }
    db abs(){
        return hypot(x,y);
    }
    db abs2(){
        return x*x+y*y;
    }
    db dis(point k1){
        return ((*this)-k1).abs();
    }
    friend ostream& operator << (ostream &os,const point &k1){
        os << "(" << k1.x << "," << k1.y << ")";
        return os;
    }
};

int main(){
    ios_base::sync_with_stdio(false);
    point P1,P2,P3,P4;
    db PH;
    point Q1,Q2,Q3,Q4;
    db QH;
    cin >> P1.x >> P1.y >> P2.x >> P2.y >> PH;
    cin >> Q1.x >> Q1.y >> Q2.x >> Q2.y >> QH;

    P3=P2+(P2-P1).turn90();
    P4=P1+(P2-P1).turn90();

    Q3=Q2+(Q2-Q1).turn90();
    Q4=Q1+(Q2-Q1).turn90();

    point PO=(P1+P3)/2;
    point QO=(Q1+Q3)/2;
    
    //cerr << "PO,QO : " << PO << " " << QO << "\n";

    auto calc=[&](point PX,point QX){
        return PX.dis(QX)+hypot(PX.dis(PO),PH)+hypot(QX.dis(QO),QH);
    };

    auto solve2=[&](point PX,point QL,point QR){
        db ans=INF;
        ans=min(ans,calc(PX,QL));
        ans=min(ans,calc(PX,QR));
        db l=0,r=1;
        for (int cc=1;cc<=100;cc++){
            db mid1=(l+l+r)/3;
            db mid2=(l+r+r)/3;
            point Qmid1=QL*(mid1)+QR*(1-mid1);
            point Qmid2=QL*(mid2)+QR*(1-mid2);
            db res1=calc(PX,Qmid1);
            db res2=calc(PX,Qmid2);
            ans=min(ans,res1);
            ans=min(ans,res2);
            if (res1<res2) r=mid2;
            else l=mid1;
        }
        return ans;
    };

    auto solve=[&](point PL,point PR,point QL,point QR){
        db ans=INF;
        ans=min(ans,solve2(PL,QL,QR));
        ans=min(ans,solve2(PR,QL,QR));
        db l=0,r=1;
        for (int cc=1;cc<=100;cc++){
            db mid1=(l+l+r)/3;
            db mid2=(l+r+r)/3;
            point Pmid1=PL*(mid1)+PR*(1-mid1);
            point Pmid2=PL*(mid2)+PR*(1-mid2);
            db res1=solve2(Pmid1,QL,QR);
            db res2=solve2(Pmid2,QL,QR);
            ans=min(ans,res1);
            ans=min(ans,res2);
            if (res1<res2) r=mid2;
            else l=mid1;
        }
        return ans;
    };

    db ans=INF;
    ans=min(ans,solve(P1,P2,Q1,Q2));
    ans=min(ans,solve(P2,P3,Q1,Q2));
    ans=min(ans,solve(P3,P4,Q1,Q2));
    ans=min(ans,solve(P4,P1,Q1,Q2));

    ans=min(ans,solve(P1,P2,Q2,Q3));
    ans=min(ans,solve(P2,P3,Q2,Q3));
    ans=min(ans,solve(P3,P4,Q2,Q3));
    ans=min(ans,solve(P4,P1,Q2,Q3));

    ans=min(ans,solve(P1,P2,Q3,Q4));
    ans=min(ans,solve(P2,P3,Q3,Q4));
    ans=min(ans,solve(P3,P4,Q3,Q4));
    ans=min(ans,solve(P4,P1,Q3,Q4));

    ans=min(ans,solve(P1,P2,Q4,Q1));
    ans=min(ans,solve(P2,P3,Q4,Q1));
    ans=min(ans,solve(P3,P4,Q4,Q1));
    ans=min(ans,solve(P4,P1,Q4,Q1));

    cout << fixed << setprecision(12) << ans << "\n";

    return 0;
}