#include <bits/stdc++.h>
using namespace std;
const int sz = 2e6 + 9;
int n, m;
char a[sz], b[sz];
int arr[sz];
int cs[sz];
int ans;
int main() {
  scanf("%s %s", a, b);
  n = strlen(a);
  m = strlen(b);
  for (int i = 0; i < n; i += m) {
    for (int j = 0; j < m; j++) arr[i + j] = (a[i + j] != b[j]);
  }
  cs[0] = arr[0];
  for (int i = 1; i < n; i++) cs[i] = cs[i - 1] + arr[i];
  for (int i = 0; i <= n - m; i++) {
    int tmp = cs[i + m - 1] - (i - 1 >= 0 ? cs[i - 1] : 0);
    ans += ((tmp & 1) == 0);
  }
  printf("%d", ans);
  return 0;
}
