#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define y1 shinkle
#define fi first
#define se second
#define bg begin
namespace IO{
#define gc getchar
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res*10)+(ch^48),ch=gc();
    return f?res:-res;
}
inline ll readll(){
    char ch=gc();
    ll res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res*10)+(ch^48),ch=gc();
    return f?res:-res;
}
inline char readchar(){
	char ch=gc();
	while(isspace(ch))ch=gc();
	return ch;
}
inline int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	s[top+1]='\0';return top;
}

}
using IO::read;
using IO::readll;
using IO::readchar;
using IO::readstring;
template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}

#define ull unsigned long long
cs ull bs=761;
cs int N=5005;

char s[N],t[N];
int f[N][N];
int n,m;
int nxt[N];
ll ans;
int stk[N],top,ps[N];
vector<int> e[N];
struct Map{
	static cs int mod=149953;
	int val[mod];ull key[mod];
    bool vs[mod];
    int stk[mod],top;
	Map(){memset(vs,0,sizeof(vs));}
    void clear(){
        while(top){
            val[stk[top]]=0;
            vs[stk[top]]=0;
            top--;
        }
    }
	cs int &operator [](cs ull &k)cs{
		int p=k%mod;
		while((vs[p])&&(key[p]!=k))p=(p==mod-1)?0:(p+1);
		return val[p];
	}
	int &operator [](cs ull &k){
		int p=k%mod;
		while((vs[p])&&(key[p]!=k))p=(p==mod-1)?0:(p+1);
		if(!vs[p])key[p]=k,stk[++top]=p,vs[p]=1;
		return val[p];		
	}
}res;
//if(l+p<=n&&j-p+1>n-l&&j>n-l)f[l][j]++;
void dfs(int u,int l){
    int &x=ps[u];
    while(x+1<=top&&(l+stk[x+1]<=n&&u-stk[x+1]+1>n-l&&u>n-l))x++;
    stk[++top]=u;
    f[u][l]=x?(ps[u]-1):0;
    for(int v:e[u]){
        ps[v]=ps[u];
        dfs(v,l);
    }
    top--;
}
void solve(char *s,char *t,int tmp){
	n=strlen(s+1),m=strlen(t+1);
	for(int l=1;l<n;l++){
		vector<char> c(n+1);
		
		for(int i=l+1;i<=n;i++){
			c[i-l]=s[i];
		}
		for(int i=1;i<=l;i++){
			c[n-l+i]=s[i];
		}
        e[0].pb(1);
		for(int i=0,j=2;j<=n;j++){
			while(i&&c[i+1]!=c[j])i=nxt[i];
			if(c[i+1]==c[j])i++;
			nxt[j]=i;
            e[i].pb(j);
		}
        top=0;
        //bfs(l);
        dfs(0,l);
        for(int i=0;i<=n;i++)e[i].clear();
	}
    ull del=1;
	for(int l=1;l<=n&&l<=m;l++){
		res.clear();
		ull vl=0;del=del*bs;
		for(int i=1;i<=l;i++){
            vl*=bs;
            vl+=s[i]-'a';
		}
		res[vl]+=f[n-l][l]+tmp;
		for(int i=l+1;i<=n;i++){
            vl=vl*bs-del*(s[i-l]-'a')+s[i]-'a';
			res[vl]+=f[n-l][i]+tmp;
		}		
		vl=0;
		for(int i=1;i<=l;i++){
            vl*=bs;
            vl+=t[i]-'a';
		}
		ans+=res[vl];
	//	cout<<"T: "<<l<<" "<<vl<<" "<<ans<<'\n';
		for(int i=l+1;i<=m;i++){
            vl=vl*bs-del*(t[i-l]-'a')+t[i]-'a';
			ans+=res[vl];
	//		cout<<"T: "<<i<<" "<<vl<<" "<<ans<<'\n';
		}
	//	cout<<"End "<<l<<" "<<ans<<'\n';
	}
}

int main(){
	#ifdef Stargazer
	freopen("1.in","r",stdin);
	#endif
    int tt=clock();
	int x1=readstring(s);
	int x2=readstring(t);
	int ok=1;
	for(int i=1;i<x1;i++)if(s[i]!=s[i+1])ok=0;
	for(int i=1;i<x2;i++)if(t[i]!=t[i+1])ok=0;
	
	if(ok){
		if(s[1]!=t[1]){
			cout<<0<<'\n';return 0;
		}
		ll ans=0;
		for(int i=1;i<=x1;i++)
		for(int j=1;j<=x2;j++)if(((i+j)&1)==0){
			ans+=1ll*(x1-i+1)*(x2-j+1);
		}
		cout<<ans<<'\n';
		return 0;
	}

	solve(s,t,1);
	solve(t,s,0);
	cout<<ans<<'\n';
 //   cerr<<clock()-tt<<'\n';
}