#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <unordered_map>

#define int long long
#define all(x) (x).begin(),(x).end()
#define pb push_back

using namespace std;

void setIO(string s) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

vector<int> a;
int ans; //min S - s

void recurse(int ind, vector<int>& team) {
    //set ind to each team
    if(ind == 12) {
        int S = 0, s = 1e18;
        vector<int> score(4);
        for(int i = 0; i < 12; ++i) {
            assert(team[i] != -1);
            score[team[i]] += a[i];
        }
        for(int i = 0; i < 4; ++i) {
            S = max(S, score[i]);
            s = min(s, score[i]);
        }
        ans = min(ans, S - s);
        return;
    }
    vector<int> amt(4);
    for(int i = 0; i < ind; ++i) {
        ++amt[team[i]];
    }
    for(int t = 0; t < 4; ++t) {
        if(amt[t] == 3) continue;
        team[ind] = t;
        recurse(ind + 1, team);
    }
}

void solve() {
    a.resize(12);
    for(int i = 0; i < 12; ++i) {
        cin >> a[i];
    }
    ans = 1e18;
    vector<int> team(12);
    recurse(0, team);
    cout << ans << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    setIO("bteams");
    solve();
}