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

typedef long long ll;
const ll maxN = 1e5 + 36;
ll n, a[maxN], b[maxN], c[maxN];

void input() {
    cin >> n;
    for (ll i = 1; i <= n; i++) cin >> a[i];
    for (ll i = 1; i <= n; i++) cin >> b[i];
    for (ll i = 1; i <= n; i++) cin >> c[i];
}

ll findmin(ll a[], ll b[], ll c[]) {
    ll ans = 2e18; 
    ll i = 1, k = 1;
    for (ll j = 1; j <= n; j++) {
        while (i < n && a[i+1] <= b[j]) i++;
        while (k < n && c[k] < b[j]) k++;
        if (a[i] <= b[j] && c[k] >= b[j]) {
            ans = min(ans, 2 * (c[k] - a[i]));
        }
    }
    return ans;
}

ll solve() {
    ll ans = 2e18;
    ans = min({
        findmin(a, b, c),
        findmin(a, c, b),
        findmin(b, a, c),
        findmin(b, c, a),
        findmin(c, a, b),
        findmin(c, b, a)
    });
    return ans;
}

void init() {
    sort(a + 1, a + 1 + n);
    sort(b + 1, b + 1 + n);
    sort(c + 1, c + 1 + n);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    input();
    init();
    cout << solve();
    
    return 0;
}