B'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)? The first line of the input contains three integers a, b and c (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a, xe2 x80 x89b, xe2 x80 x89c xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x, xe2 x80 x89y, xe2 x80 x89z xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000) -- the number of blue, violet and orange spheres that he needs to get. If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "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.'...