#include "bits/stdc++.h"
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using ll = long long;
using pii = pair<int, int>;

string condense(string t){
	string res;
	for(char c : t){
		res.push_back(c);
		if(res.size() >= 2 && res[res.size() - 1] == res[res.size() - 2])
			res.pop_back();
	}
	return res;
}

const int N = 2e4 + 11;
int R[N];

void solve(int TC) {
	string s, t; 
	cin >> s >> t;
	t = condense(t);
	for(int i = 0; i < s.size(); i++){
		R[i] = s.size();
	}
	for(int i = 0; i < s.size(); i++){
		int n = s.size(), m = t.size();
		int l = i, r = 0;
		bool failed = false;
		if(l != n - 1 && m >= 2){
			if(!(s[l] == t[r] && s[l + 1] == t[r + 1])
			&& !(s[l + 1] == t[r] && s[l] == t[r + 1]))
				failed = true;
			else{
				l += 2; r += 2;
			}
		}
		while(r != m){
			if(l == n){
				failed = true;
				break;
			}
			if(s[l] == t[r]){
				l++; r++;
				continue;
			}
			if(r < 2 || t[r - 2] != t[r]){
				failed = true;
				break;
			}
			r++;
		}

		if(failed) R[i] = s.size();
		else R[i] = l - 1;
	}
	for(int i = (int) s.size() - 2; i >= 0; i--){
		R[i] = min(R[i], R[i + 1]);
	}
	int ans = 0;
	for(int i = 0; i < s.size(); i++){
		ans += s.size() - R[i];
	}
	cout << ans << '\n';
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	// cin >> t;

	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}