#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long llinf = 1e18 + 7;
const double eps = 1e-15;
int cmp(pair<int, int> a, pair<int, int> b) {
  return a.first - a.second < b.first - b.second;
}
int main() {
  pair<int, int> a[3];
  for (int i = 0; i < 3; ++i) scanf("%d", &a[i].first);
  for (int i = 0; i < 3; ++i) scanf("%d", &a[i].second);
  sort(a, a + 3, cmp);
  int need = 0;
  for (int i = 0; i < 3; ++i)
    if (a[i].second - a[i].first > 0) need += a[i].second - a[i].first;
  for (int i = 0; i < 3; ++i)
    if (a[i].second - a[i].first < 0) need -= (a[i].first - a[i].second) / 2;
  if (need <= 0)
    puts("Yes");
  else
    puts("No");
  return 0;
}
