#include <bits/stdc++.h>
using namespace std;
const int N = 6e5 + 5, M = 1e3 + 5;
const long long INF = 1e18 + 5;
inline long long read() {
  long long sum = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    sum = sum * 10 + c - '0';
    c = getchar();
  }
  return sum * fh;
}
inline int read2() {
  char c = getchar();
  while (c != 'S' && c != 'T' && c != '*' && c != '.') c = getchar();
  if (c == 'S') return 2;
  if (c == 'T') return 3;
  return c == '*' ? 0 : 1;
}
inline int read3() {
  char c = getchar();
  while (c < 'a' || c > 'z') {
    c = getchar();
  }
  return c - 'a';
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
inline long long ab(long long x) { return x < 0 ? -x : x; }
inline long long fpow(long long qwe, long long asd, long long zxc) {
  if (asd < 0) return 0;
  long long a = qwe, b = 1, c = asd;
  while (c) {
    if (c & 1) b = b * a % zxc;
    a = a * a % zxc;
    c >>= 1;
  }
  return b;
}
long long a[N] = {0}, b[N] = {0};
priority_queue<pair<long long, long long> > qwe;
int main() {
  int n;
  for (int i = 1; i <= 6; ++i) a[i] = read();
  sort(a + 1, a + 6 + 1);
  n = read();
  long long imi = 1e9, ans = 1e9;
  for (int i = 1; i <= n; ++i)
    b[i] = read(), qwe.push(pair<long long, long long>(b[i] - a[1], 1)),
    imi = min(imi, b[i] - a[1]);
  ans = min(ans, qwe.top().first - imi);
  while (1) {
    pair<long long, long long> asd = qwe.top();
    qwe.pop();
    if (asd.second == 6) break;
    long long x = asd.first, y = asd.second;
    x -= a[y + 1] - a[y];
    qwe.push(pair<long long, long long>(x, y + 1));
    imi = min(imi, x);
    ans = min(ans, qwe.top().first - imi);
  }
  cout << ans << endl;
}
