#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5e3+5,M=4e3+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,g[N][N],f[N][N];char s[N],t[N];
ll ans;
void calc1(){
	int i,j;Me(f,0);
	for(i=n;i;i--) for(j=m;j;j--){
		if(s[i]==t[j]) f[i][j]=f[i+1][j+1]+1;
		else f[i][j]=0;
		ans+=f[i][j];
	}
}
void calc2(char *s,int n,char *t,int m){
	int i,j;Me(f,0);
	for(i=1;i<=n;i++) for(j=1;j<=n;j++){
		if(s[i]==s[j]) f[i][j]=f[i-1][j-1]+1;
		else f[i][j]=0;
	}
	// gdb(g[3][3],f[2][4],s[2],s[4]);
	Me(g,0);
	for(i=1;i<=n;i++) for(j=i+2;j<=n;j++){
		g[i+1][j-1]++;g[i+1][j-1-f[i][j]]--;
	}
	for(i=1;i<=n;i++) for(j=n;j>=i;j--) g[i][j]+=g[i][j+1];
	for(i=1;i<=n;i++){
		g[i][i-1]=0;
		for(j=i;j<=n;j++) g[i][j]+=g[i][j-1];
	}
	Me(f,0);
	for(i=n;i;i--)for(j=m;j;j--){
		if(s[i]==s[j]) f[i][j]=f[i+1][j+1]+1;
		else f[i][j]=0;
	}
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) ans+=g[i][i+f[i][j]-1];
}
void Solve(){
	int i,j;scanf("%s",s+1);scanf("%s",t+1);
	n=strlen(s+1);m=strlen(t+1);
	calc1();gdb(ans);
	calc2(s,n,t,m);calc2(t,m,s,n);
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}