#include <bits/stdc++.h>
using namespace std;
void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
int ctz(unsigned x) { return __builtin_ctz(x); }
int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
int clz(unsigned x) { return __builtin_clz(x); }
int clzll(unsigned long long x) { return __builtin_clzll(x); }
int popcnt(unsigned x) { return __builtin_popcount(x); }
int popcntll(unsigned long long x) { return __builtin_popcountll(x); }
int bsr(unsigned x) { return 31 ^ clz(x); }
int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
int a[6];
int b[100016], f[100016];
int main() {
  canhazfast();
  int n, ans, lo;
  priority_queue<pair<int, int>, vector<pair<int, int> > > q;
  for (int i = 0; i < 6; ++i) cin >> a[i];
  sort(a, a + 6);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> b[i];
  sort(b, b + n);
  n = unique(b, b + n) - b;
  for (int i = 0; i < n; ++i) q.emplace(b[i] - a[0], i);
  lo = (*min_element(b, b + n)) - a[0];
  ans = q.top().first - lo;
  for (;;) {
    pair<int, int> p = q.top();
    q.pop();
    int u = p.second;
    if (f[u] == 5) break;
    int x = b[u] - a[++f[u]];
    q.emplace(x, u);
    lo = min(lo, x);
    ans = min(ans, q.top().first - lo);
  }
  cout << ans << '\n';
  return 0;
}
