#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> s;
using i64 = long long;
// using u32 = unsigned int;
// using u64 = unsigned long long;
// using i128 = __int128_t;
using namespace std;
const int N = 5e5 + 5;
// const int B = 455;
// const int M = 2e6 + 5;
// const int base = 13131;
// const int base = 17171;
// const int mod = 998244353;
const int mod = 1e9 + 7;
// const i64 mod = 1000000000000000003LL;
// const double pi = acos(-1);

int n = 3, a[3], b[3];
void solve()
{
    for (int i = 0; i < n; i++)
        cin >> a[i] >> b[i];
    double l = -1e5, r = 1e5, mid1, mid2;
    int cnt = 100;
    auto cal = [&](double x) -> double
    {
        double l = -1e5, r = 1e5, mid1, mid2;
        int cnt = 100;
        auto cal1 = [&](double x, double y) -> double
        {
            double res = 0;
            res += sqrt((a[0] - x) * (a[0] - x) + (b[0] - y) * (b[0] - y));
            res += 2 * sqrt((a[1] - x) * (a[1] - x) + (b[1] - y) * (b[1] - y));
            res += 3 * sqrt((a[2] - x) * (a[2] - x) + (b[2] - y) * (b[2] - y));
            return res;
        };
        while (cnt--)
        {
            mid1 = l + (r - l) / 3;
            mid2 = mid1 + (r - l) / 3;
            if (cal1(x, mid1) < cal1(x, mid2))
                r = mid2;
            else
                l = mid1;
        }
        return min(cal1(x, mid1), cal1(x, mid2));
    };
    while (cnt--)
    {
        mid1 = l + (r - l) / 3;
        mid2 = mid1 + (r - l) / 3;
        if (cal(mid1) < cal(mid2))
            r = mid2;
        else
            l = mid1;
    }
    cout << min(cal(mid1), cal(mid2)) << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    cout << fixed << setprecision(10);
    while (t--)
        solve();
}