#include<bits/stdc++.h>

using namespace std;
#define N 5050
int lcs[N][N], lcp[N][N], dp[N][N];

void solve() {
    string s, t;
    cin >> s >> t;
    int lens = s.length();
    int lent = t.length();
    s = '.' + s;
    t = '.' + t;
    long long ans = 0;
    for (int i = lens; i >= 1; i--) {
        for (int j = lens; j >= 1; j--) {
            if (s[i] == s[j]) {
                lcp[i][j] = lcp[i + 1][j + 1] + 1;
            } else lcp[i][j] = 0;
        }
    }
    for (int i = 1; i <= lens; i++) {
        for (int j = 1; j <= lent; j++) {
            if (s[i] == t[j]) {
                lcs[i][j] = lcs[i - 1][j - 1] + 1;
            } else lcs[i][j] = 0;
        }
    }
    for (int i = 1; i <= lens; i++) {
        for (int j = 1; j <= lent; j++) {
            dp[i][lcs[i][j]]++;
        }
        for (int j = 5000; j >= 0; j--) {
            dp[i][j] += dp[i][j + 1];
        }
        for (int j = 1; j <= 5000; j++) {
            dp[i][j] += dp[i][j - 1];
        }
    }
    for (int i = 1; i <= lens; i++) {
        for (int j = i; j <= lens; j++) {
            int len = j - i + 1;
            int LCP = min(len - 1, lcp[i][j + 1]);
            ans = ans + dp[j][len] - dp[j][len - LCP - 1];
        }
    }
    for (int i = 0; i <= 5020; i++) {
        for (int j = 0; j <= 5020; j++) {
            lcp[i][j] = lcs[i][j] = dp[i][j] = 0;
        }
    }
    for (int i = 1; i <= lent; i++) {
        for (int j = 1; j <= lent; j++) {
            if (t[i] == t[j]) {
                lcs[i][j] = lcs[i - 1][j - 1] + 1;
            } else lcs[i][j] = 0;
        }
    }
    for (int i = lent; i >= 1; i--) {
        for (int j = lens; j >= 1; j--) {
            if (t[i] == s[j]) {
                lcp[i][j] = lcp[i + 1][j + 1] + 1;
            } else lcp[i][j] = 0;
            ans = ans - lcp[i][j];
        }
    }
    for (int i = 1; i <= lent; i++) {
        for (int j = 1; j <= lens; j++) {
            dp[i][lcp[i][j]]++;
        }
        for (int j = 5000; j >= 0; j--) {
            dp[i][j] += dp[i][j + 1];
        }
        for (int j = 1; j <= 5000; j++) {
            dp[i][j] += dp[i][j - 1];
        }
    }
    for (int i = 1; i <= lent; i++) {
        for (int j = i; j <= lent; j++) {
            int len = j - i + 1;
            int LCS = min(len - 1, lcs[i - 1][j]);
            ans = ans + dp[i][len] - dp[i][len - LCS - 1];
        }
    }
    cout << ans;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
//    cin >> T;
    while (T--) solve();
    return 0;
}