#include"bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,fast-math",2,3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
const int maxn = 5010;
const int maxN = 12500010;
int n,m;
char a[maxn],b[maxn];
int A[maxn][maxn],C[maxn][maxn];
void GetLcp(char* a,char* b,int Ta,int Tb){
	for(int i=Ta;i>=1;i--)
		for(int j=Tb;j>=1;j--){
			if(a[i]==b[j])C[i][j]=(i==Ta||j==Tb?0:C[i+1][j+1])+1;
			else C[i][j]=0;
		}
}
void GetLcs(char* a,char* b,int Ta,int Tb){
	for(int i=1;i<=Ta;i++)
		for(int j=1;j<=Tb;j++){
			if(a[i]==b[j])A[i][j]=A[i-1][j-1]+1;
			else A[i][j]=0;
		}
}
int s[maxn];
long long Ans=0;
void Solve(){
	GetLcs(a,a,n,n);
	GetLcp(a,b,n,m);
	int T=max(n,m);
	for(int l=2;l<=n;l++){
		for(int j=1;j<=m;j++)
			if(C[l][j])
				s[C[l][j]]++;
		for(int i=T;i>=1;i--)s[i]=s[i]+s[i+1];
		for(int i=1;i<=n;i++)s[i]=s[i-1]+s[i];
		for(int r=l;r<=n;r++){
			if(!A[l-1][r])continue;
			if(min(r-l+1,A[l-1][r])==r-l+1)Ans+=s[r-l];
			else Ans+=s[r-l]-s[r-l-A[l-1][r]];
		}
		for(int i=0;i<=T;i++)s[i]=0;
	}
}
int main(){
	scanf("%s%s",a+1,b+1);
	n=strlen(a+1),m=strlen(b+1);
	GetLcp(a,b,n,m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			Ans+=C[i][j];
	Solve();
	swap(a,b),swap(n,m);
	Solve();
	cout<<Ans<<endl;
}