#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
typedef vector<int> vi;

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 5007;

string s, t;

ll ANS;

int n, m, lcps[N][N], lcpst[N][N], cnt[N][N], ans[N][N];

inline void calc() {
    n = s.length() - 1;
    m = t.length() - 1;
    int L = min(n, m);
    per(i, n, 1) per(j, n, 1) {
        if (s[i] != s[j]) lcps[i][j] = 0;
        else lcps[i][j] = 1 + ((i == n || j == n) ? 0 : lcps[i + 1][j + 1]);
    }
    per(i, n, 1) per(j, m, 1) {
        if (s[i] != t[j]) lcpst[i][j] = 0;
        else lcpst[i][j] = 1 + ((i == n || j == m) ? 0 : lcpst[i + 1][j + 1]);
    }
    memset(ans, 0, sizeof(ans));
    rep(x, 1, n) {
        // rep(*, 1, m) ans[x][l] += [lcpst[x][*] >= l]
        // l \in [1, lcpst[x][*]]
        ans[x][1] = m;
        rep(j, 1, m) --ans[x][lcpst[x][j] + 1];
        rep(j, 1, L) ans[x][j] += ans[x][j - 1];
    }
    memset(cnt, 0, sizeof(cnt));
    rep(y, 1, n) rep(z, y + 2, n) {
        ++cnt[y + 1][z - y - 1];
        --cnt[y + lcps[y][z] + 1][z - y - lcps[y][z] - 1];
    }
    rep(i, 1, n) per(j, n, 1) cnt[i][j] += cnt[i - 1][j + 1];
    rep(x, 2, n) rep(l, 1, n - x) {
        ANS += 1ll * ans[x][l] * cnt[x][l];
    }
}

int main() {
    cin >> s >> t;
    s = " " + s;
    t = " " + t;
    calc();
    swap(s, t);
    calc();
    rep(i, 1, n) rep(j, 1, m) ANS += lcpst[i][j];
    printf("%lld\n", ANS);
    return 0;
}