#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int a[8];
    cin >> a[1] >> a[2] >> a[3] >> a[4] >> a[5] >> a[6];
    int n;
    cin >> n;
    vector<int>v(n + 3), val;
    set<int>st;
    map<int, vector<int> >mp;
    for(int i = 1; i <= n; i++){
        cin >> v[i];
        for(int j = 1; j <= 6; j++){
            if(st.find(v[i] - a[j]) == st.end()){
                val.push_back(v[i] - a[j]);
                st.insert(v[i] - a[j]);
            }
            mp[v[i] - a[j]].push_back(i);
        }
    }
    vector<int>cnt(n + 5, 0);
    int ans = 1e9 + 50;
    sort(val.begin(), val.end());
    int j = -1, c = 0;
    for(int i = 0; i < val.size(); i++){
        if(c == n){
            ans = min(ans, val[j] - val[i]);
            for(int r = 0; r < mp[val[i]].size(); r++){
                int p = mp[val[i]][r];
                cnt[p]--;
                if(cnt[p] == 0){
                    c--;
                }
            }
            continue;
        }
        for(int k = j + 1; k < val.size(); k++){
            for(int r = 0; r < mp[val[k]].size(); r++){
                int p = mp[val[k]][r];
                cnt[p]++;
                if(cnt[p] == 1){
                    c++;
                }
            }
            if(c == n){
                ans = min(ans, val[k] - val[i]);
                j = k;
                break;
            }
            if(k == n){
                j = n + 1;
            }
        }
        if(j == n + 1){
            break;
        }
        for(int r = 0; r < mp[val[i]].size(); r++){
            int p = mp[val[i]][r];
            cnt[p]--;
            if(cnt[p] == 0){
                c--;
            }
        }
    }
    cout << ans;
    return 0;
}