#include <iostream>
#include <numeric>
#include <vector>

struct UnionFind {
    std::vector<int> par;
    int gnum;

    explicit UnionFind(int n)
        : par(n), gnum(n) {
        std::iota(par.begin(), par.end(), 0);
    }

    void reset() {
        std::iota(par.begin(), par.end(), 0);
        gnum = par.size();
    }

    int find(int v) {
        return (par[v] == v) ? v : (par[v] = find(par[v]));
    }

    void unite(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;
        par[v] = u;
        --gnum;
    }
};

using lint = long long;

constexpr lint INF = 1LL << 60;
constexpr int N = 5;
constexpr int M = N * N;

const std::vector<int> ds{1, N};

UnionFind uf(M);

bool connected(int b) {
    uf.reset();

    for (int i = 0; i < M; ++i) {
        {
            int j = i + 1;
            if (j < M && ((b >> i) & 1) == ((b >> j) & 1)) {
                uf.unite(i, j);
            }
        }
        {
            int j = i + N;
            if (j < M && ((b >> i) & 1) == ((b >> j) & 1)) {
                uf.unite(i, j);
            }
        }
    }

    return uf.gnum == 2;
}

void solve() {
    std::vector<lint> xs(M);
    for (auto& x : xs) std::cin >> x;

    lint ans = INF;
    for (int b = 0; b < (1 << (M - 1)); ++b) {
        if (!connected(b)) continue;

        lint score = 0;
        for (int i = 0; i < M; ++i) {
            if ((b >> i) & 1) {
                score += xs[i];
            } else {
                score -= xs[i];
            }
        }
        ans = std::min(ans, std::abs(score));
    }

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}