#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();
		if(res.size() >= 4 && res[res.size() - 1] == res[res.size() - 3]
							+ res[res.size() - 2] == res[res.size() - 4])
			res.pop_back(), res.pop_back();
	}
	return res;
}

const int N = 1e5 + 11;
typedef unsigned long long ull;
ull X = 145849, ps[N], pt1[N], pt2[N], pw[N];
int R[N];
int f(string s, string t1, string t2){
	if(s.size() < t1.size()) return 0;
	pw[0] = 1; for(int i = 1; i < N; i++) pw[i] = pw[i - 1] * X;
	ps[0] = 0; for(int i = 0; i < s.size(); i++) ps[i + 1] = ps[i] * X + s[i];
	pt1[0] = 0; for(int i = 0; i < t1.size(); i++) pt1[i + 1] = pt1[i] * X + t1[i];
	pt2[0] = 0; for(int i = 0; i < t2.size(); i++) pt2[i + 1] = pt2[i] * X + t2[i];
	for(int i = 0; i < s.size(); i++) R[i] = s.size();
	for(int i = 0; i <= s.size() - t1.size(); i++){
		if(ps[i + t1.size()] - ps[i] * pw[t1.size()] == pt1[t1.size()]){
			R[i] = i + t1.size() - 1;
		}
	}
	for(int i = 0; i <= s.size() - t2.size(); i++){
		if(ps[i + t2.size()] - ps[i] * pw[t2.size()] == pt2[t2.size()]){
			R[i] = i + t2.size() - 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];
	}
	return ans;
}

void solve(int TC) {
	string s, t; cin >> s >> t;
	t = condense(t);
	int ans = 0;
	if(t.size() == 2){
		string t1 = t;
		reverse(t.begin(), t.end());
		ans += f(s, t1, t);
	}else{
		ans += f(s, t, t); 
	}
	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);
	}
}