#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
char s[5011],t[5011];
ull hs[5011],ht[5011],pw[5011];const ull B=801,P=1e7+19;
struct umap
{
	struct edge{ull v;int w,next;edge(){}edge(ull _v,int _w,int _next){v=_v;w=_w;next=_next;}}e[30000011];int head[P],sz;
	void init(){memset(head,-1,sizeof(head));sz=0;}
	int& operator[](ull v)
	{
		int u=v%P;
		for(int i=head[u];~i;i=e[i].next)if(e[i].v==v)return e[i].w;
		e[++sz]=edge(v,0,head[u]);head[u]=sz;return e[sz].w;
	}
	int find(ull v)
	{
		int u=v%P;
		for(int i=head[u];~i;i=e[i].next)if(e[i].v==v)return e[i].w;
		return 0;
	}
}mpt;
int n,m;
ull ans=0;
char str[5011];
int nxt[5011],cnt[5011];
void solve(int I,bool d=0)
{//printf("solve(%d)\n",I);
	int pt=0;
	for(int i=I+1;i<=n;++i)str[++pt]=s[i];
	str[++pt]='#';
	for(int i=1;i<=I;++i)str[++pt]=s[i];
	// printf("str:%s\n",str+1);
	nxt[0]=-1;nxt[1]=0;
	for(int i=2;i<=n+1;++i)
	{
		int p=nxt[i-1];
		while(~p&&str[p+1]!=str[i])p=nxt[p];
		nxt[i]=p+1;
	}
	for(int i=1;i<=n+1;++i)cnt[i]=cnt[nxt[i]]+1;
	// printf("nxt:");for(int i=1;i<=n+1;++i)printf("%d ",nxt[i]);putchar(10);
	// printf("cnt:");for(int i=1;i<=n+1;++i)printf("%d ",cnt[i]);putchar(10);
	for(int l=1;l<=I;++l)
	{
		int coe=cnt[n+1-(I-l+1)]-d;//printf("[%d,%d] coe:%d\n",l,I,coe);
		if(coe)
		{
			ull H=hs[I]-hs[l-1]*pw[I-l+1];
			ans+=1ll*coe*mpt.find(H);
		}
		// printf("after [%d,%d] ans:%llu\n",l,I,ans);
	}
}
int main()
{
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1),m=strlen(t+1);
	// reverse(s+1,s+1+n);reverse(t+1,t+1+m);
	for(int i=1;i<=n;++i)hs[i]=hs[i-1]*B+s[i];
	for(int i=1;i<=m;++i)ht[i]=ht[i-1]*B+t[i];
	pw[0]=1;for(int i=1;i<=5000;++i)pw[i]=pw[i-1]*B;
	mpt.init();
	for(int l=1;l<=m;++l)
	{
		for(int r=l;r<=m;++r)++mpt[ht[r]-ht[l-1]*pw[r-l+1]];
	}
	for(int i=1;i<=n;++i)solve(i);
	swap(s,t);swap(n,m);swap(hs,ht);
	mpt.init();
	for(int l=1;l<=m;++l)
	{
		for(int r=l;r<=m;++r)++mpt[ht[r]-ht[l-1]*pw[r-l+1]];
	}
	for(int i=1;i<=n;++i)solve(i,1);
	printf("%llu\n",ans);
	fclose(stdin);fclose(stdout);return 0;
}