#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||'9'<ch){if(ch=='-')f=-1;ch=getchar();}
	while('0'<=ch&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return x*f;
}
const int N=5003;
char s[N],t[N],z[N];
int n,m,f[N][N],g[N][N];
ll ans=0,sumn[N],suml[N];
inline void solve(int flag){
	memset(f,0,sizeof(f));
	memset(g,0,sizeof(g));
	memset(sumn,0,sizeof(sumn));
	memset(suml,0,sizeof(suml));
	for(int i=n;i>=1;--i){
		for(int j=n;j>=1;--j){
			if(s[i]==s[j])
				f[i][j]=f[i+1][j+1]+1;
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j)
			if(s[i]==t[j])
				g[i][j]=g[i-1][j-1]+1;
	}
	for(int i=1;i<=n;++i){
		for(int j=0;j<=m;++j)
			sumn[j]=suml[j]=0;
		for(int j=1;j<=m;++j){
			if(!g[i][j])continue;
			++sumn[g[i][j]];
			suml[g[i][j]]+=g[i][j];
		}
		for(int j=1;j<=m;++j){
			sumn[j]+=sumn[j-1];
			suml[j]+=suml[j-1];
		}
		for(int j=1;j<=i;++j){
			int len=f[i+1][j],dis=i+1-j;
			ll L=max(1,dis-len),R=min(dis-flag,m);
			if(L>R)continue;
			ans+=suml[R]-suml[L-1]-(sumn[R]-sumn[L-1])*(L-1);
			ans+=(sumn[m]-sumn[R])*(R-L+1);
		}
	}
}

int main(){
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1),m=strlen(t+1);
	solve(0);
	for(int i=1;i<=n/2;++i)swap(s[i],s[n-i+1]);
	for(int i=1;i<=m/2;++i)swap(t[i],t[m-i+1]);
	swap(s,t);swap(n,m);
	solve(1);
	printf("%lld\n",ans);
	return 0;
}