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

#define ll long long 
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define fi first
#define se second
#define all(a) a.begin(), a.end()

#define N 5050

int lcp[N][N]; // longest common prefix of s[i:] and s[j:]
int lcs[N][N]; // longest common suffix of s[:i] and t[:j]
ll pre[N], sum[N];

ll go(string s, string t) {
    memset(lcp, 0, sizeof lcp);
    memset(lcs, 0, sizeof lcs);

    int n = s.length(), m = t.length();
    for (int i = n-1; i >= 0; -- i) {
        for (int j = n-1; j >= 0; -- j) {
            lcp[i][j] = s[i] != s[j] ? 0 : 1 + lcp[i+1][j+1];
        }
    }
    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= m; ++ j) {
            lcs[i][j] = s[i-1] != t[j-1] ? 0 : 1 + lcs[i-1][j-1];
        }
    }

    ll res = 0;
    for (int r = 1; r < n; ++ r) {
        pii x(1, 0);
        memset(pre, 0, sizeof pre);
        memset(sum, 0, sizeof sum);
        for (int j = 1; j <= m; ++ j) {
            sum[lcs[r][j]] += lcs[r][j];
            pre[lcs[r][j]] ++;
            x.se = max(x.se, lcs[r][j]);
        }
        for (int j = N-2; j >= 0; -- j) {
            sum[j] += sum[j+1];
            pre[j] += pre[j+1];
        }
        if (x.fi > x.se) continue;

        for (int l = 0; l < r; ++ l) {
            int len = lcp[l][r];
            pii y(r - l - len, r - l - 1);
            if (y.fi > y.se) continue;
            if (y.fi > x.se || y.se < x.fi) continue;

            pii z(max(x.fi, y.fi), min(x.se, y.se));
            ll di = sum[z.fi] - sum[z.se] - (pre[z.fi] - pre[z.se]) * (z.fi - 1) + pre[z.se] * (z.se - z.fi + 1);
            res += di;
        }
    }

    return res;
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    string s, t; cin >> s >> t;
    ll res = 0;
    for (int i = 1; i <= s.length(); ++ i) {
        for (int j = 1; j <= t.length(); ++ j) {
            lcs[i][j] = s[i-1] != t[j-1] ? 0 : 1 + lcs[i-1][j-1];
            res += lcs[i][j];
        }
    }
    res += go(s, t) + go(t, s);

    cout << res << '\n';
}