#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return power((x * x) % (long long int)1000000007, y / 2);
  else
    return (x * power((x * x) % (long long int)1000000007, (y - 1) / 2)) %
           (long long int)1000000007;
}
long long int modInverse(long long int n) {
  return power(n, (long long int)1000000007 - 2);
}
long long int sa[1000005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    string a, b;
    cin >> a >> b;
    long long int ob = 0;
    for (long long int i = 0; i < b.size(); i++) {
      if (b[i] == '1') ob++;
    }
    long long int ch = ob % 2;
    sa[0] = 0;
    for (long long int i = 1; i < a.size() + 1; i++) {
      sa[i] = a[i - 1] - '0' + sa[i - 1];
    }
    long long int ans = 0;
    for (long long int i = b.size(); i < a.size() + 1; i++) {
      if ((sa[i] - sa[i - b.size()]) % 2 == ch) ans++;
    }
    cout << ans;
  }
}
