#include<bits/stdc++.h>
using namespace std;

#define MAXN 5005
#define mo1 10260817
#define mo2 998244353
#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#define int long long
const int o1 = 2333;
const int o2 = 1999;

int n,m;
char s[MAXN],t[MAXN];
struct aa {
	signed y,w,ls;
}b[20000000];
int CNT = 0;
int nn;
signed d[mo1+3];
//vector<aa>p[mo1+3];
#define pb push_back
void ins(int x,int y,int w) {
	for(int j = d[x]; j != 0; j = b[j].ls) {
		if(b[j].y == y) {
			b[j].w += w;
			return;
		}
	}
	nn ++;
	b[nn] = {y,w,d[x]};
	d[x] = nn;
}

int find(int x,int y) {
	for(int j = d[x]; j != 0; j = b[j].ls) {
		if(b[j].y == y) return b[j].w;
	}
	return 0;
}
signed g[MAXN][MAXN];
long long an = 0;
int sg[MAXN],t1;
int kmp[MAXN],z[MAXN];

void qwq(char *s,char *t,int k) {
	n = strlen(s+1);
	m = strlen(t+1);
	memset(d,0,sizeof(d));
	nn = 0;
	for(int i = 1; i <= m; i ++) {
		int s1 = 0,s2 = 0;
		for(int j = i; j <= m; j ++) {
			s1 = (s1*o1+t[j])%mo1;
			s2 = (s2*o2+t[j])%mo2;
			ins(s1,s2,1);
		}
	}
	//cout<<clock()-t1<<"\n";
	 for(int i = 1; i <= n; i ++) {
		int s1 = 0,s2 = 0;
		for(int j = i; j <= n; j ++) {
			s1 = (s1*o1+s[j])%mo1;
			s2 = (s2*o2+s[j])%mo2;
			g[i][j] = find(s1,s2);
		//	cout<<i<<" "<<j<<" "<<s1<<" "<<s2<<" "<<g[i][j]<<"??\n";
			if(k == 1) an += g[i][j];
		}

	}
//	cout<<an<<" "<<clock()-t1<<" "<<CNT<<"\n";
//int cnt = 0;
	for(int j = 1;j <= n; j ++) {

		memset(kmp,0,sizeof(kmp));
		kmp[j-1] = kmp[j] = j-1;
		int tt = j-1;
		memset(z,0,sizeof(z));
		z[j] = 1;
	//	cout<<j<<"-----\n";
		for(int i = j+1; i <= n; i ++) {
			while(tt > j-1 && s[i] != s[tt+1]) {
				tt = kmp[tt];
			//	cout<<tt<<"\n";
			//	cnt ++;
			}
			if(s[i] == s[tt+1]) tt ++;
			kmp[i] = tt;
			z[i] = z[kmp[i]]+1;
		//	cout<<i<<" "<<kmp[i]<<"?\n";
		}

		tt = j-1;
		for(int i = 1; i < j; i ++) {
			while(tt > j-1 && s[i] != s[tt+1]) {
				tt = kmp[tt];
			//	cnt ++;
			}
			if(s[i] == s[tt+1]) tt ++;
			an += g[i+1][j-1]*z[tt];

			//cout<<i<<" "<<j-1<<" "<<g[i+1][j-1]<<" "<<tt<<" "<<z[tt]<<"\n";
		//	cout<<i<<" "<<tt<<" "<<l<<"?\n";
//			an += sg[i]-sg[i-l];
		}
	//	cout<<cnt<<"\n";
	}
	//	cout<<an<<"\n";

}

signed main() {
	scanf("%s",s+1);
	scanf("%s",t+1);
	/*t1 = clock();
	for(int i = 1; i <= 5000;i ++) {
		s[i] = 'a'+rand()%2;
		t[i] = 'a'+rand()%2;

	}*/
	qwq(s,t,1);
	qwq(t,s,2);
	cout<<an;
	return 0;
}