#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  for (int i = 0; i < int(a.size()); ++i)
    out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}
void smain();
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(12) << fixed;
  smain();
  return 0;
}
void bad() {
  cout << "NO";
  exit(0);
}
const long long oo = 1e15 + 10;
void smain() {
  int m = 6;
  vector<long long> a(m);
  for (int i = 0; i < int(m); ++i) {
    cin >> a[i];
  }
  int n;
  cin >> n;
  vector<long long> b(n);
  vector<pair<long long, long long> > kek;
  for (int i = 0; i < int(n); ++i) {
    cin >> b[i];
    for (int j = 0; j < int(m); ++j) {
      kek.push_back({b[i] - a[j], i});
    }
  }
  sort(kek.rbegin(), kek.rend());
  long long ans = oo;
  set<pair<long long, long long> > vals;
  vector<long long> cur_val(n, -1);
  for (auto x : kek) {
    long long val = x.first, id = x.second;
    if (cur_val[id] != -1) vals.erase({cur_val[id], id});
    cur_val[id] = val;
    vals.insert({cur_val[id], id});
    if (vals.size() == n) {
      long long cans = (*vals.rbegin()).first - (*vals.begin()).first;
      ans = min(ans, (cans));
    }
  }
  cout << ans;
}
