#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
const long double pi = 3.14159265358979323846;
long long n, m, k, q, l, r, x, y, z;
const long long template_array_size = 1e6 + 585;
long long a[template_array_size];
long long b[template_array_size];
long long c[template_array_size];
string second, t;
long long ans = 0;
void solve(int tc = 0) {
  string a, b;
  cin >> a;
  cin >> b;
  int aCnt = 0;
  int bCnt = 0;
  int ans = 0;
  for (int i = 0; i < b.size(); i++) {
    if (b[i] == '1') bCnt++;
    if (a[i] == '1') aCnt++;
  }
  if ((aCnt + bCnt) % 2 == 0) {
    ans++;
  }
  for (int i = b.size(); i < a.size(); i++) {
    if (a[i - b.size()] == '1') aCnt--;
    if (a[i] == '1') {
      aCnt++;
    }
    if ((aCnt + bCnt) % 2 == 0) {
      ans++;
    }
  }
  cout << ans;
}
int main() {
  { ios_base::sync_with_stdio(false); }
  {
    cin.tie(NULL);
    cout.tie(NULL);
  }
  int tc = 1;
  for (int t = 0; t < tc; t++) solve(t);
  return 0;
}
