// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
const int base=101;

int N,M,R[maxn];
string s,t;

void solve(){
    cin >> s >> t;
    N=(int)s.length();
    M=(int)t.length();

    string nt;
    for(int i=0;i<M;i++) if(!i || nt.back()!=t[i]) nt+=t[i];
    t=nt;M=(int)t.length();

    for(int i=0;i<N;i++) R[i]=N;
    for(int i=0;i<N;i++){
        int l=i,r=0;
        bool check=true;
        if(M>=2 && i<N-1){
            if((s[l]!=t[r+1] || s[l+1]!=t[r]) && (s[l]!=t[r] || s[l+1]!=t[r+1])) check=false;
            else l+=2,r+=2;
        }
        while(r<M){
            if(l>=N){
                check=false;
                break;
            }
            if(s[l]==t[r]){
                l++;r++;
                continue;
            }
            if(r<2 || t[r-2]!=t[r]){
                check=false;
                break;
            }
        }
        R[i]=(check?l-1:N);
    }
    for(int i=N-2;i>=0;i--) R[i]=min(R[i],R[i+1]);
    int res=0;
    for(int i=0;i<N;i++) res+=N-R[i];
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}