#include <bits/stdc++.h>
using namespace std;
long long int exp(long long int x, long long int y) {
  long long int res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long int modinv(long long int x) { return exp(x, 1000000007 - 2); }
long long int add(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a + b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int sub(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a - b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int mul(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a * b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int log2n(long long int n) { return (n > 1) ? 1 + log2n(n / 2) : 0; }
long long int fac[100009];
long long int ncr_mod(long long int n, long long int k) {
  long long int ans = fac[n];
  ans *= modinv(fac[k]);
  ans %= 1000000007;
  ans *= modinv(fac[n - k]);
  ans %= 1000000007;
  return ans;
}
vector<long long int> v_prime;
void Sieve(long long int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (prime[p]) v_prime.emplace_back(p);
}
vector<long long int> v_factor;
void factor(long long int n) {
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        v_factor.emplace_back(i);
      else {
        v_factor.emplace_back(i), v_factor.emplace_back(n / i);
      };
    }
  }
  sort(v_factor.begin(), v_factor.end());
}
void out(vector<long long int>& a) {
  for (long long int i = 0; i < a.size(); i++) cout << a[i] << " ";
  cout << endl;
}
void sout(set<long long int> s) {
  for (auto it = s.begin(); it != s.end(); ++it) cout << *it << " ";
  cout << endl;
}
void mout(map<long long int, long long int> mm) {
  for (auto it = mm.begin(); it != mm.end(); ++it)
    cout << it->first << " " << it->second << endl;
}
long long int power(long long int x, long long int y) {
  long long int temp;
  if (y == 0) return 1;
  temp = power(x, y / 2);
  if (y % 2 == 0)
    return temp * temp;
  else
    return x * temp * temp;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cerr.tie(0);
  ;
  long long int t = 1;
  while (t--) {
    long long int n, i, x, y, ok = 0, sum = 0, ans = 0, j, k, cnt = 0, m, c = 0;
    long long int h[100009] = {0};
    n = 14;
    string s;
    vector<long long int> a(n, 0), v, b(n, 0);
    for (i = 0; i < n; i++) {
      cin >> a[i];
      b[i] = a[i];
    }
    for (i = 0; i < n; i++) {
      sum = 0;
      if (a[i] % 2 == 1) {
        x = a[i] / 14;
        y = a[i] - 14 * x;
        b[i] = 0;
        for (long long int i1 = 0; i1 < n; i1++) {
          b[i1] += x;
        }
        for (j = i + 1; j < n; j++) {
          if (y != 0) {
            b[j] += 1;
            y--;
          }
        }
        for (j = 0; j <= i; j++) {
          if (y != 0) {
            b[j] += 1;
            y--;
          }
        }
      }
      for (long long int i1 = 0; i1 < n; i1++) {
        if (b[i1] % 2 == 0) sum += b[i1];
      }
      ans = max(ans, sum);
      b = a;
    }
    cout << ans;
  }
}
