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 com.sun.javafx.scene.layout.region.Margins;

import java.io.*;
import java.util.*;
import java.math.*;

public class GGWPLivaem implements Runnable {
    boolean withFiles = false;
    class cc implements Comparable<cc> {
        public int x, y;
        cc(int x, int y) {
            this.x = x;
            this.y = y;
        }
        public int compareTo(cc other) {
            if (this.x == other.x) {
                return Integer.compare(this.y, other.y);
            }
            return Integer.compare(this.x, other.x);
        }
    }

    private void solve() throws IOException {
        int n = 3;
        int a[] = new int[1000];
        int b[] = new int[1000];
        for (int i = 1; i <= n; ++i) {
            a[i] = in.nextInt();
        }
        for (int i = 1; i <= n; ++i) {
            b[i] = in.nextInt();
        }
        int rr = 0, ll = 0;
        for (int i = 1; i <= n; ++i) {
            if (a[i] > b[i]) {
                rr += a[i] - b[i] - ((a[i] - b[i]) % 2 == 1 ? 1 : 0);
            }
            else {
                ll += b[i] - a[i];
            }
        }
        if (ll * 2 <= rr) {
            out.println("Yes");
        }
        else {
            out.println("No");
        }
    }


    private static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;
        String cache;
        int cur;

        FastScanner(Reader r) throws IOException {
            reader = new BufferedReader(r);
            tokenizer = new StringTokenizer("");
            cache = null;
            cur = 0;
        }

        public boolean hasNext() {
            if (cache != null && cur < cache.length())
                return true;
            try {
                while (!tokenizer.hasMoreTokens()) {
                    String line = reader.readLine();
                    if (line == null)
                        return false;
                    tokenizer = new StringTokenizer(line);
                }
                cache = tokenizer.nextToken();
                cur = 0;
            }
            catch (IOException e) {
                return false;
            }
            return true;
        }

        public char nextChar() throws IOException {
            if (!hasNext())
                throw new EOFException();
            return cache.charAt(cur++);
        }

        public String next() throws IOException {
            if (!hasNext())
                throw new EOFException();
            String result = (cur == 0) ? cache : cache.substring(cur);
            cache = null;
            return result;
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(this.next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(this.next());
        }

        public double nextDouble() throws IOException {
            return Double.parseDouble(this.next());
        }

        public BigInteger nextBigInteger() throws IOException {
            return new BigInteger(this.next());
        }

        public void close() throws IOException {
            reader.close();
            tokenizer = new StringTokenizer("");
        }
    }


    public static void main(String args[]) throws IOException {
        new Thread(null, new GGWPLivaem(), "Thread #228", 64 * 1024 * 1024).start();
    }

    public void run() {
        try {
            if (withFiles) {
                in = new FastScanner(new FileReader("input.txt"));
                out = new PrintWriter(new FileWriter("output.txt"));
            }
            else {
                in = new FastScanner(new InputStreamReader(System.in));
                out = new PrintWriter(System.out);
            }
            solve();
            in.close();
            out.close();
        }
        catch (IOException e) {
            e.printStackTrace();
        }
    }

    FastScanner in;
    PrintWriter out;
}