#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double dinf = inf;
const int N = 1e6 + 10;
const int M = 18 + 10;
const int mod = 998244353;
const double eps = 1e-10;
char a[N], b[N];
int main() {
  int n, m;
  scanf("%s%s", a, b);
  n = strlen(a);
  m = strlen(b);
  int cnt1 = 0, cnt2 = 0, ans = 0;
  for (int i = 0; i < (m); i++)
    if (a[i] & 1) cnt1 ^= 1;
  for (int i = 0; i < (m); i++)
    if (b[i] & 1) cnt2 ^= 1;
  if (cnt1 % 2 == cnt2 % 2) ans++;
  for (int i = m; i < n; i++) {
    cnt1 ^= a[i] ^ a[i - m];
    if (cnt1 % 2 == cnt2 % 2) ans++;
  }
  printf("%d\n", ans);
  return 0;
}
