#include<bits/stdc++.h>
using namespace std;
constexpr int M=5005;
int lcp1[M][M],lcp2[M][M],sum1[M][M],sum2[M][M];
int n,m;string s,t;long long ans;
void solve(){
	m=s.length()-1;n=t.length()-1;
	for (int i=m;i;i--)
		for (int j=n;j;j--)
			lcp1[i][j]=s[i]==t[j]?lcp1[i+1][j+1]+1:0;
	for (int i=n;i;i--)
		for (int j=n;j;j--)
			lcp2[i][j]=t[i]==t[j]?lcp2[i+1][j+1]+1:0;
	for (int i=1;i<=n;i++)
		for (int j=i;j<=n;j++)
			sum1[i][j]=sum2[i][j]=0;
	for (int i=1;i<=m;i++)
		for (int j=1;j<=n;j++)
			sum1[j][j]++,sum1[j][j+lcp1[i][j]]--;
	for (int i=1;i<=n;i++)
		for (int j=i+1;j<=n;j++)
			lcp2[i][j]=min(lcp2[i][j],j-i-1),
			sum2[i+1][j-1]++,sum2[i+lcp2[i][j]+1][j-1]--;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			sum1[i][j]+=sum1[i][j-1],sum2[i][j]+=sum2[i-1][j];
	for (int i=1;i<=n;i++)
		for (int j=i;j<=n;j++)
			ans+=1ll*sum1[i][j]*sum2[i][j];
	for (int i=1;i<=m;i++) for (int j=1;j<=n;j++) lcp1[i][j]=0;
	for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) lcp2[i][j]=0;
}
signed main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>s>>t;
	s=" "+s;t=" "+t;
	solve();swap(s,t);solve();
	for (int i=1;i<=n;i++)
		for (int j=i;j<=n;j++)
			ans+=sum1[i][j];
	printf("%lld\n",ans);
	return 0;
}