Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings a and b. It is known that |b| ≤ |a|, that is, the length of b is at most the length of a.

The Cossack considers every substring of length |b| in string a. Let's call this substring c. He matches the corresponding characters in b and c, after which he counts the number of positions where the two strings are different. We call this function f(b, c).

For example, let b = 00110, and c = 11000. In these strings, the first, second, third and fourth positions are different.

Vus the Cossack counts the number of such substrings c such that f(b, c) is even.

For example, let a = 01100010 and b = 00110. a has four substrings of the length |b|: 01100, 11000, 10001, 00010. 

  * f(00110, 01100) = 2;
  * f(00110, 11000) = 4;
  * f(00110, 10001) = 4;
  * f(00110, 00010) = 1.



Since in three substrings, f(b, c) is even, the answer is 3.

Vus can not find the answer for big strings. That is why he is asking you to help him.

Input

The first line contains a binary string a (1 ≤ |a| ≤ 10^6) — the first string.

The second line contains a binary string b (1 ≤ |b| ≤ |a|) — the second string.

Output

Print one number — the answer.

Examples

Input


01100010
00110


Output


3


Input


1010111110
0110


Output


4

Note

The first example is explained in the legend.

In the second example, there are five substrings that satisfy us: 1010, 0101, 1111, 1111.
import javafx.util.Pair;

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Stream;

public class Main {
    void solve(FastScanner in, PrintWriter out) {
        String a = in.next();
        String b = in.next();

        int cntb = 0;
        for (char c : b.toCharArray()) {
            cntb += c - '0';
        }

        int left = 0;
        int right = b.length() - 1;
        int cntc = 0;
        for (int i = 0; i <= right; i++) {
            cntc += a.charAt(i) - '0';
        }
        right++;
        int ans = update(cntb, cntc);
        for (int i = right; i < a.length(); i++) {
            cntc -= (a.charAt(left) - '0');
            cntc += (a.charAt(i) - '0');
            left++;
            ans += update(cntb, cntc);
        }

        System.out.println(ans);
    }

    int update(int a, int b) {
        if (a % 2 == b % 2) {
            return 1;
        }
        return 0;
    }

    public static void main(String[] args) throws FileNotFoundException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
//        FastScanner in = new FastScanner(new FileInputStream("input.txt"));
//        PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));
        new Main().solve(in, out);
        out.close();
    }

    static class FastScanner {
        StringTokenizer st;
        BufferedReader br;

        public FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public FastScanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        public boolean hasNext() {
            return st.hasMoreElements();
        }

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

        public byte nextByte() {
            return Byte.parseByte(next());
        }

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

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

        public boolean nextBoolean() {
            return Boolean.parseBoolean(next());
        }
    }
}
