#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long gcd(long long a, long long b) { return (!b ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
const long long mod = 1e9 + 7;
const long long MOD = 998244353;
const int INF32 = 1 << 30;
const long long INF64 = 1LL << 60;
const long double pi = 3.141592653589793;
long long modpow(long long n, long long k, long long mod) {
  if (k == 0) return 1;
  long long r = modpow(n * n % mod, k >> 1, mod);
  if (k & 1) r = r * n % mod;
  return r;
}
void solve() {
  vector<int> a(6);
  for (int i = 0; i < 6; i++) cin >> a[i];
  int n;
  cin >> n;
  vector<int> b(n);
  for (int i = 0; i < n; i++) cin >> b[i];
  vector<vector<int>> d(n, vector<int>(6, 0));
  sort(a.rbegin(), a.rend());
  sort(b.begin(), b.end());
  for (int i = 0; i < n; i++)
    for (int j = 0; j < 6; j++) d[i][j] = b[i] - a[j];
  priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>,
                 greater<pair<int, pair<int, int>>>>
      pq;
  int ans = d[n - 1][0] - d[0][0];
  for (int i = 0; i < n; i++) pq.push({d[i][0], {i, 0}});
  int maxi = d[n - 1][0];
  while (true) {
    auto tmp = pq.top();
    pq.pop();
    int val = tmp.first;
    int i = tmp.second.first;
    int j = tmp.second.second;
    ans = min(ans, maxi - val);
    if (j == 5) break;
    pq.push({d[i][j + 1], {i, j + 1}});
    maxi = max(maxi, d[i][j + 1]);
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
