#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long int inverse(long long int i) {
  if (i == 1) return 1;
  return (MOD - ((MOD / i) * inverse(MOD % i)) % MOD + MOD) % MOD;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string a, b;
  cin >> a >> b;
  long long n = a.size(), m = b.size(), ans = 0;
  long long dp[n + 1], dp1[m + 1];
  dp[0] = 0;
  for (int i = 0; i < n; i++) {
    dp[i + 1] = dp[i] ^ (a[i] - '0');
  }
  dp1[0] = 0;
  for (int i = 0; i < m; i++) {
    dp1[i + 1] = dp1[i] ^ (b[i] - '0');
  }
  for (int i = 0; i <= n - m; i++) {
    if ((dp1[m] ^ dp[i] ^ dp[i + m]) == 0) ans++;
  }
  cout << ans << "\n";
}
