Magic Spheres

D - Magic Spheres

Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Submit Status

Description

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".

Sample Input

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

Hint

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.

题意：给你a,b,c个不同颜色的小球，任意两个相同颜色的小球可以变成一个其他颜色的小球，现在问是否可以得到x,y,z个不同颜色的球

先计算一下各种小球前后数目的变化量，如果变化量大于0，表示减少了，反之增加；如果大于0则再除2代表可以转换的最大数量，小于0的不变；然后全部相加判断是否大于0，

大于0表示可以，否则不行。

#include<stdio.h>
int main()
{
    int a,b,c,x,y,z;
    while(~scanf("%d%d%d%d%d%d",&a,&b,&c,&x,&y,&z))
    {
        a=a-x;
        b=b-y;
        c=c-z;
        int sum=0;
        if(a>=0)
            sum+=a/2;
        else
            sum+=a;
        if(b>=0)
            sum+=b/2;
        else
            sum+=b;
        if(c>=0)
            sum+=c/2;
        else
            sum+=c;
        if(sum>=0)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}