Problem: Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at least x blue, y violet and z orange spheres. Can he get them (possible, in multiple actions)?

Input

The first line of the input contains three integers a, b and c (0 ≤ a, b, c ≤ 1 000 000) — the number of blue, violet and orange spheres that are in the magician's disposal.

The second line of the input contains three integers, x, y and z (0 ≤ x, y, z ≤ 1 000 000) — the number of blue, violet and orange spheres that he needs to get.

Output

If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".

Examples

Input

4 4 0
2 1 2


Output

Yes


Input

5 6 1
2 7 2


Output

No


Input

3 3 3
2 2 2


Output

Yes

Note

In the first sample the wizard has 4 blue and 4 violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have 2 blue and 5 violet spheres. Then he turns 4 violet spheres into 2 orange spheres and he ends up with 2 blue, 1 violet and 2 orange spheres, which is exactly what he needs.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
const int MAXN = 10010;
int a[5], b[5];
int cnt[5], need[5];
int solve() {
  memset(cnt, 0, sizeof cnt);
  memset(need, 0, sizeof need);
  for (int i = 0; i < 3; i++) cin >> a[i];
  for (int i = 0; i < 3; i++) cin >> b[i];
  int j = 0, k = 0;
  for (int i = 0; i < 3; i++) {
    if (a[i] >= b[i])
      cnt[j++] = a[i] - b[i];
    else
      need[k++] = b[i] - a[i];
  }
  int flag;
  if (j == 3)
    flag = 1;
  else if (j == 2) {
    if (need[0] <= cnt[0] / 2 + cnt[1] / 2)
      flag = 1;
    else if (cnt[0] / 2 > 0 && cnt[0] / 2 - 1 + (cnt[1] + 1) / 2 >= need[0])
      flag = 1;
    else if (cnt[1] / 2 > 0 && cnt[1] / 2 - 1 + (cnt[0] + 1) / 2 >= need[0])
      flag = 1;
    else
      flag = 0;
  } else if (j == 1) {
    if (need[0] + need[1] <= cnt[0] / 2)
      flag = 1;
    else
      flag = 0;
  } else
    flag = 0;
  return flag;
}
int main() {
  if (solve())
    puts("Yes");
  else
    puts("No");
  return 0;
}