#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define PB push_back
#define FS first
#define SD second
template<class X, class Y> void cmn(X &a, Y b) { a=min<X>(a, b); }
template<class X, class Y> void cmx(X &a, Y b) { a=max<X>(a, b); }
typedef pair<int, int> pii;
typedef vector<int> vi;

vi pi(const string& s) {
    vi p(sz(s));
    rep(i,1,sz(s)) {
        int g = p[i-1];
        while (g && s[i] != s[g]) g = p[g-1];
        p[i] = g + (s[i] == s[g]);
    }
    return p;
}
vi match(const string& s, const string& pat) {
    vi p = pi(pat + '\0' + s), res;
    rep(i,sz(p)-sz(s),sz(p))
        if (p[i] == sz(pat)) res.PB(i - 2 * sz(pat));
    return res;
}

int gdzie[1000002];

pair<string, vi> simplify(string s, bool work) {
    string ns = "";
    vi rem;
    for (auto c : s) {
        if (work) {
            if (!ns.empty() && ns.back() == c) {
                rem.back()++;
                continue;
            }
            if (sz(ns) >= 3 && ns[sz(ns) - 3] == ns.back() && ns[sz(ns) - 2] == c) {
                ns.pop_back();
                rem.back()++;
                continue;
            }
        }
        ns += c;
        rem.PB(1);
    }
    for (int i = sz(rem)-2; i >= 0; i--) {
        rem[i] += rem[i+1];
    }
    return {ns, rem};
}

signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    string s, t; vi suf;
    cin >> s >> t;
    auto para = simplify(s, false); t = simplify(t, true).FS;
//    cerr << t << "\n";
    s = para.FS, suf = para.SD;
    suf.PB(0);
    auto kmp = match(s, t);
//    for (auto v : kmp)
//        cerr << v << " ";
//    cerr << "\n";
    int last = sz(s), li = sz(kmp) - 1, res = 0;
    assert(sz(s) == sz(suf) - 1);
    for (int i = sz(s)-1; i >= 0; i--) {
        if (li >= 0 && i == kmp[li]) {
            li--;
            last = i + sz(t) - 1;
        }
        if (i + 1 < sz(s) && sz(t) == 2 && s[i] == t[1] && s[i+1] == t[0]) {
            last = i + 1;
        }
//        cerr << i << " " << last << "\n";
        res += suf[last];
    }
    cout << res << "\n";
}