#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 5005;
LL Ans;
int n, m;
int z[maxn], s[maxn][maxn];
int nxt[maxn];
char A[maxn], B[maxn];
void getlcp(char ss[], int id) {
    int N = strlen(ss);
    for (int i = 0; i <= n; i++) z[i] = 0;
    for (int i = 1, l = 0, r = 0; i < N; ++i) {
        if (i <= r && z[i - l + id] < r - i + 1)z[i + id] = z[i - l + id];
        else {
            z[i + id] = max(0, r - i + 1);
            while (i + z[i + id] < n && ss[z[i + id]] == ss[i + z[i + id]]) ++z[i + id];
        }
        if (i + z[i + id] - 1 > r) l = i, r = i + z[i + id] - 1;
    }
    for (int j = id + 2; j <= n; j++) {
        s[id + 1][j - 1]++;
        s[id + min(z[j], j - 1 - id) + 1][j - 1]--;
    }
}
int v[maxn];
void cal(char b[], int id,int N) {
    int pos = 0;
    for (int i = 1; i <= n; i++)v[i] = nxt[i] = 0;
    for (int i = 2; i <= N; i++) {
        while (pos && b[pos + 1] != b[i]) pos = nxt[pos];
        if (b[pos + 1] == b[i]) pos++;
        nxt[i] = pos;
    }
    int len = 0;
    for (int i = 1; i <= m; i++) {
        while (len && b[len + 1] != B[i])len = nxt[len];
        if (b[len + 1] == B[i])len++;
        v[len]++;
    }
    for (int i = N; i >= 1; i--) {
        v[nxt[i]] += v[i];
        Ans += 1ll*v[i] * s[id][id+i-1];
    }
}
void comm(char b[], int id, int N) {
    int pos = 0;
    for (int i = 1; i <= N; i++)v[i]= nxt[i] = 0;
    for (int i = 2; i <= N; i++) {
        while (pos && b[pos + 1] != b[i]) pos = nxt[pos];
        if (b[pos + 1] == b[i]) pos++;
        nxt[i] = pos;
    }
    int len = 0;
    for (int i = 1; i <= m; i++) {
        while (len && b[len + 1] != B[i])len = nxt[len];
        if (b[len + 1] == B[i]) len++;
        v[len]++;
    }
    for (int i = N; i >= 1; i--) {
        v[nxt[i]] += v[i];
        Ans += v[i];
    }
}
void solve(string&a,string&b) {
    n = a.size();m = b.size();
    for (int i = 0; i <= n; i++)for (int j = 0; j <= n; j++)s[i][j] = 0;
    for (int i = 0; i < a.size(); i++)A[i + 1] = a[i];
    for (int i = 0; i < b.size(); i++)B[i + 1] = b[i];
    A[n + 1] = '\0'; B[m + 1] = '\0';
    for (int i = 1; i <= n; i++) getlcp(A + i, i);
    for (int j = 1; j <= n; j++)for (int i = 1; i <= n; i++)s[i][j] += s[i - 1][j];
    for (int i = 1; i <= n; i++) cal(A + i-1, i,n-i+1);
}
int main() {
    string a, b;
    cin >> a >> b;
    solve(b, a);
    solve(a, b);
    for (int i = 1; i <= n; i++) comm(A + i - 1, i,n-i+1);
    cout << Ans << '\n';
    return 0;
}