#include <bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
const int N=5005,b1=229,m1=1e9+7,b2=19260817,m2=998244353;
int p1[N],p2[N];
struct sb{
	int n,ht[N],h1[N],h2[N],sa[N*2],rk[N*2],t[N*2];
	short c[N][N];
	char s[N*2];
	ull v1(int l,int r) {return (h1[r]-1ll*h1[l-1]*p1[r-l+1]%m1+m1)%m1;}
	ull v2(int l,int r) {return (h2[r]-1ll*h2[l-1]*p2[r-l+1]%m2+m2)%m2;}
	ull val(int l,int r) {return ull(v1(l,r))<<32|v2(l,r);}
	void init(){
		scanf("%s",s+1);
		n=strlen(s+1);
		for(int i=1;i<=n;i++)
			h1[i]=(1ll*h1[i-1]*b1+s[i])%m1,
			h2[i]=(1ll*h2[i-1]*b2+s[i])%m2,
			sa[i]=i,rk[i]=s[i];
		for(int w=1;w<n;w<<=1){
			sort(sa+1,sa+n+1,[&](int x,int y){
				return rk[x]==rk[y]?rk[x+w]<rk[y+w]:rk[x]<rk[y];
			});
			memcpy(t,rk,sizeof rk);
			for(int i=1,k=0;i<=n;i++)
				if(t[sa[i]]==t[sa[i-1]]&&t[sa[i]+w]==t[sa[i-1]+w]) rk[sa[i]]=k;
				else rk[sa[i]]=++k;
		}
		for(int i=1,k=0;i<=n;i++){
			if(k) k--;
			while(s[i+k]==s[sa[rk[i]-1]+k]) k++;
			ht[rk[i]]=k;
		}
		for(int i=1;i<n;i++){
			int mi=n;
			for(int j=i+1;j<=n;j++){
				mi=min(mi,ht[j]);
				int x=sa[i],y=sa[j];
				if(x>y) swap(x,y);
				c[--y][x]++;c[y][x+mi+1]--;
			}
		}
		c[n][1]=1;
		for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) c[i][j]+=c[i][j-1];
	}
}A,B;
const int M=22922922;
ull key[M];
int mp[M],mc[M];
int main(){
	for(int i=p1[0]=p2[0]=1;i<N;i++) p1[i]=1ll*p1[i-1]*b1%m1,p2[i]=1ll*p2[i-1]*b2%m2;
	A.init();B.init();
	long long ans=0;
	for(int i=1;i<=A.n;i++) for(int j=1;j<=i;j++){
		ull v=A.val(j,i);
		int x=v%M;
		while(key[x]&&key[x]!=v) if(++x==M) x=0;
		key[x]=v;mp[x]++;mc[x]+=A.c[i][j];
	}
	for(int i=1;i<=B.n;i++) for(int j=1;j<=i;j++){
		ull v=B.val(j,i);
		int x=v%M;
		while(key[x]&&key[x]!=v) if(++x==M) x=0;
		if(!key[x]) continue;
		ans+=B.c[i][j]*mp[x]+mc[x]-mp[x];
	}
	cout<<ans;
	return 0;
}