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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Scanner;
import java.util.AbstractList;
import java.util.Comparator;
import java.util.Collections;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int a = in.nextInt();
            int b = in.nextInt();
            int c = in.nextInt();
            int x = in.nextInt();
            int y = in.nextInt();
            int z = in.nextInt();

            List<Pair> pairs = new ArrayList<Pair>(ArrayUtils.asList(new int[]{a, b, c}, new int[]{x, y, z}));
            Collections.sort(pairs, new Comparator<Pair>() {

                public int compare(Pair o1, Pair o2) {
                    return o2.x - o2.y - o1.x + o1.y;
                }
            });

            out.println(check(pairs) ? "Yes" : "No");
        }

        private boolean check(List<Pair> pairs) {
            int extra = 0;
            for (Pair p : pairs) {
                if ((p.x - p.y) * 2 + extra < 0) {
                    return false;
                }

                if (p.x - p.y > 0) {
                    extra += (p.x - p.y) / 2 * 2;
                } else {
                    extra += (p.x - p.y) * 2;
                }
            }
            return true;
        }

    }

    static class Pair {
        public int x;
        public int y;

        Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }


        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Pair pair = (Pair) o;

            if (x != pair.x) return false;
            return y == pair.y;

        }


        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }


        public String toString() {
            return "Pair{" +
                    "x=" + x +
                    ", y=" + y +
                    '}';
        }

    }

    static class ArrayUtils {
        public static List<Pair> asList(final int[] xs, final int[] ys) {
            return new AbstractList<Pair>() {

                public Pair get(int index) {
                    return new Pair(xs[index], ys[index]);
                }

                public int size() {
                    return xs.length;
                }
            };
        }

    }
}