Magic Spheres

A - Magic Spheres

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

Submit  Status  Practice  CodeForces 606A

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 2orange spheres, which is exactly what he needs.

---

正确代码如下

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