#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int x, f[N], ans;
char a[N], b[N];
int main() {
  scanf("%s%s", a + 1, b + 1);
  int n = strlen(a + 1), m = strlen(b + 1);
  for (int i = 1; i <= m; i++) x += b[i] - '0';
  for (int i = 1; i <= n; i++) f[i] = f[i - 1] + (a[i] - '0');
  for (int i = m; i <= n; i++) {
    int tmp = f[i] - f[i - m];
    if (tmp % 2 == x % 2) {
      ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
