#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
string A, B;
int a[N], b[N];
int main() {
  while (cin >> A >> B) {
    int len1 = A.size(), len2 = B.size();
    for (int i = 0; i <= len1 - 1; i++) a[i] = A[i] - '0';
    for (int i = 0; i <= len2 - 1; i++) b[i] = B[i] - '0';
    int sum = 0;
    for (int i = 0; i <= len2 - 1; i++) sum ^= (a[i] ^ b[i]);
    int ans = sum == 0;
    for (int i = 1; i <= len1 - len2; i++) {
      sum ^= a[i - 1];
      sum ^= a[i - 1 + len2];
      ans += sum == 0;
    }
    printf("%d\n", ans);
  }
  return 0;
}
