#include <bits/stdc++.h>
const int INFint = 2147483647;
const long long INF = 9223372036854775807ll;
const long long MOD = 1000000007ll;
const double EPS = 1e-8;
using namespace std;
long long rty[13];
void quickSort(int l, int r) {
  int x = rty[l + (r - l) / 2];
  int i = l;
  int j = r;
  while (i <= j) {
    while (rty[i] < x) i++;
    while (rty[j] > x) j--;
    if (i <= j) {
      swap(rty[i], rty[j]);
      i++;
      j--;
    }
  }
  if (i < r) quickSort(i, r);
  if (l < j) quickSort(l, j);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  quickSort(0, 10);
  long long a, b, c, x, y, z;
  cin >> a >> b >> c >> x >> y >> z;
  long long s = 0, p = 0;
  if (a > x)
    s += (a - x) / 2;
  else
    p += x - a;
  if (b > y)
    s += (b - y) / 2;
  else
    p += y - b;
  if (c > z)
    s += (c - z) / 2;
  else
    p += z - c;
  if (p == 0) {
    cout << "Yes";
    return 0;
  }
  if (s == 0) {
    if (p == 0)
      cout << "Yes";
    else
      cout << "No";
    return 0;
  }
  if (p > s)
    cout << "No";
  else
    cout << "Yes";
  return 0;
}
