CF606A.Magic Spheres

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)?

卡尔是一名初学的魔术师。他有 $a$ 个蓝色、$b$ 个紫色和 $c$ 个橙色魔法球。在一次操作中，他可以将两个同色球转变为一个任意其他颜色的球。为了施展一个前所未见的魔法，他至少需要 $x$ 个蓝色、$y$ 个紫色和 $z$ 个橙色球。他能否通过若干次操作（可能多次）达成这一目标？

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.

输入的第一行包含三个整数 $a$、$b$ 和 $c$（$0 \leq a,\,b,\,c \leq 1\,000\,000$），分别表示魔术师手中拥有的蓝色、紫色和橙色小球的数量。

输入的第二行包含三个整数 $x$、$y$ 和 $z$（$0 \leq x,\,y,\,z \leq 1\,000\,000$），分别表示他需要获得的蓝色、紫色和橙色小球的数量。

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

如果巫师能够获得所需数量的球体，则输出“Yes”；否则，输出“No”。

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.

在第一个样例中，巫师有 4 个蓝色球和 4 个紫色球。他的第一步操作是将两个蓝色球转化为一个紫色球。此后，他将拥有 2 个蓝色球和 5 个紫色球。接着，他将 4 个紫色球转化为 2 个橙色球，最终得到 2 个蓝色球、1 个紫色球和 2 个橙色球，这恰好满足他的需求。