#include <cstdio>
#include <cstring>

using namespace std;

const int N = 5050;

char tmp1[N], tmp2[N];
int jed_s[N][N], pref[N][N], jed_raz[N][N], cnt[N];
long long ans = 0;

void solve(char *s, char *t, int raz) {
	int n = strlen(s), m = strlen(t);
	memset(jed_s, 0, sizeof(jed_s));
	memset(jed_raz, 0, sizeof(jed_raz));
	memset(pref, 0, sizeof(pref));
	for(int i = n - 1;i >= 0;i--) {
		for(int j = n - 1;j > i;j--) {
			if(s[i] == s[j])
				jed_s[i][j] = 1 + jed_s[i + 1][j + 1];
		}
	}
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < m;j++) {
			if(s[i] == t[j])
				jed_raz[i][j] = 1 + ((i && j) ? jed_raz[i - 1][j - 1] : 0);
		}
	}
	for(int l = 0;l < n;l++) {
		for(int r = l;r < n;r++) {
			pref[r][l + raz]++;
			pref[r][l + jed_s[l][r + 1] + 1]--;
		}
	}
	for(int r = 0;r < n;r++) {
		for(int l = 1;l <= r;l++)
			pref[r][l] += pref[r][l - 1];
		for(int j = 0;j < m;j++)
			cnt[jed_raz[r][j]]++;
		for(int i = n - 1;i >= 1;i--)
			cnt[i] += cnt[i + 1];
		for(int i = 1;i <= r + 1;i++)
			ans += (long long)cnt[i] * pref[r][r - i + 1], cnt[i] = 0;
	}
}

int main(){
	scanf("%s", tmp1);
	scanf("%s", tmp2);
	solve(tmp1, tmp2, 0);
	solve(tmp2, tmp1, 1);
	printf("%lld\n", ans);
}