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


const int inf = 1e9;
const int N = 5007;
int ds[N][N], dt[N][N], dp[N][N], ct[N][N];
int32_t main() {
    string s, t; cin >> s >> t;

    ll ans = 0, x = 0;
    auto solve = [&] (string s, string t) {
        memset(dp,0,sizeof dp);memset(ds,0,sizeof ds);memset(dt,0,sizeof dt); memset(ct,0,sizeof ct);
        int n = s.size(), m = t.size();
        for (int i = n - 1; i >= 0; --i) {
            for (int j = m - 1; j >= 0; --j) {
                if (s[i]==t[j]) {
                    dp[i][j] = dp[i + 1][j + 1] + 1;
                }
            }
        }
        for (int i = n - 1;i >= 0; --i) {
            for (int j= n - 1; j >= 0; --j) {
                if (s[i]==s[j]) {
                    ds[i][j] = ds[i + 1][j + 1] + 1;
                }
            }
        }
        for (int i = m - 1; i >= 0; --i) {
            for (int j = m - 1; j >= 0; --j) {
                if (t[i]==t[j]) {
                    dt[i][j]=dt[i+1][j+1]+1;
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            vector <int> su(n + 2);
            for (int j = 0; j < m; ++j) {
                su[dp[i][j]]++;
            }
            for (int x = n; x >= 0; --x) {
                su[x] += su[x + 1];
                ct[i][x] = su[x];
            }
        }

        for (int j = 0; j < n; ++j) {
            vector <int> l(n + 1);
            for (int i = 0; i < j; ++i) {
                int so = ds[i][j];
                if (so) {
                    l[i + 1]++;
                    l[i + so + 1]--;
                }

            }

            for (int f = 0; f < j; ++f) {
                if (f) {
                    l[f] += l[f - 1];
                    ans += (long long)l[f] * ct[f][j-f];
                }
            }
        }

        for (int i = 0; i < n; ++i) {
            for (int len = 1; i + len <= n; ++len) {
                x += ct[i][len];
            }
        }
    };

    solve(s,t);x=0;
    solve(t,s);
    cout << ans + x << endl;
    return 0;
}