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

#define PB emplace_back
#define int long long
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define per(i, a, b) for(int i = (a); i >= (b); --i)

const int N = 5000;
int a, b, f[N + 5][N + 5], nxt[N + 5], w[N + 5], c[N + 5][N + 5];
char s[N + 5], t[N + 5];

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> s + 1 >> t + 1;
	a = strlen(s + 1), b = strlen(t + 1);
	per(i, a, 1) per(j, a, 1) if(s[i] == s[j]) f[i][j] = f[i + 1][j + 1] + 1;
	rep(i, 1, a) {
		rep(j, 1, i - 1) ++c[i][j + 1], --c[i][j + f[j][i] + 1];
		rep(j, 1, a) c[i][j] += c[i][j - 1];
	}
	int ans = 0;
	rep(i, 1, a) {
		nxt[i] = i - 1;
		int j = i - 1;
		rep(k, i + 1, a) {
			while(j >= i && s[j + 1] != s[k]) j = nxt[j];
			if(s[j + 1] == s[k]) ++j;
			nxt[k] = j;
		}
		rep(j, 0, a) w[j] = 0;
		int k = 0;
		rep(j, 1, b) {
			while(k >= i && s[k + 1] != t[j]) k = nxt[k];
			k = max(k, i - 1);
			if(s[k + 1] == t[j]) ++k;
			++w[k];
		}
		per(j, a, 1) w[nxt[j]] += w[j];
		rep(j, i, a) ans += w[j];
		rep(j, i + 1, a) ans += w[j - 1] * c[j][i];
	}
	swap(s, t);
	memset(f, 0, sizeof(f));
	memset(nxt, 0, sizeof(nxt));
	memset(c, 0, sizeof(c));
	memset(w, 0, sizeof(w));
	a = strlen(s + 1), b = strlen(t + 1);
	per(i, a, 1) per(j, a, 1) if(s[i] == s[j]) f[i][j] = f[i + 1][j + 1] + 1;
	rep(i, 1, a) {
		rep(j, 1, i - 1) ++c[i][j + 1], --c[i][j + f[j][i] + 1];
		rep(j, 1, a) c[i][j] += c[i][j - 1];
	}
	rep(i, 1, a) {
		nxt[i] = i - 1;
		int j = i - 1;
		rep(k, i + 1, a) {
			while(j >= i && s[j + 1] != s[k]) j = nxt[j];
			if(s[j + 1] == s[k]) ++j;
			nxt[k] = j;
		}
		rep(j, 0, a) w[j] = 0;
		int k = 0;
		rep(j, 1, b) {
			while(k >= i && s[k + 1] != t[j]) k = nxt[k];
			k = max(k, i - 1);
			if(s[k + 1] == t[j]) ++k;
			++w[k];
		}
		per(j, a, 1) w[nxt[j]] += w[j];
		rep(j, i + 1, a) ans += w[j - 1] * c[j][i];
	}
	cout << ans << '\n';
	return 0;
}