#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, a, b) for(int i=(a);i<=(b);++i)
#define per(i, a, b) for(int i=(a);i>=(b);--i)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define sz(x) (int)x.size()
#define endl "\n"
const int N = 5005, mod = 998244353, inf = 2e9;

struct SA {
    int n;
    std::vector<int> sa, rk, lc;
    vv<vv<int>> st;

    SA(std::string s) {
        n = s.size();
        sa.resize(n);
        lc.resize(n);
        rk.resize(n);
        std::iota(sa.begin(), sa.end(), 0);
        std::sort(sa.begin(), sa.end(),
                  [&](int a, int b) {
                      return s[a] < s[b];
                  });
        rk[sa[0]] = 0;
        for (int i = 1; i < n; i++) {
            rk[sa[i]] = rk[sa[i - 1]] + (s[sa[i]] != s[sa[i - 1]]);
        }
        int k = 1;
        std::vector<int> tmp, cnt(n);
        tmp.reserve(n);
        while (rk[sa[n - 1]] < n - 1) {
            tmp.clear();
            for (int i = 0; i < k; i++) {
                tmp.push_back(n - k + i);
            }
            for (auto i: sa) {
                if (i >= k) {
                    tmp.push_back(i - k);
                }
            }
            std::fill(cnt.begin(), cnt.end(), 0);
            for (int i = 0; i < n; i++) {
                cnt[rk[i]]++;
            }
            for (int i = 1; i < n; i++) {
                cnt[i] += cnt[i - 1];
            }
            for (int i = n - 1; i >= 0; i--) {
                sa[--cnt[rk[tmp[i]]]] = tmp[i];
            }
            std::swap(rk, tmp);
            rk[sa[0]] = 0;
            for (int i = 1; i < n; i++) {
                rk[sa[i]] = rk[sa[i - 1]] + (tmp[sa[i - 1]] < tmp[sa[i]] ||
                                             sa[i - 1] + k == n ||
                                             tmp[sa[i - 1] + k] <
                                             tmp[sa[i] + k]);
            }
            k *= 2;
        }
        for (int i = 0, j = 0; i < n; i++) {
            if (rk[i] == 0) {
                j = 0;
            } else {
                for (j -= j > 0; i + j < n && sa[rk[i] - 1] + j < n &&
                                 s[i + j] == s[sa[rk[i] - 1] + j];) {
                    j++;
                }
                lc[rk[i] - 1] = j;
            }
        }
    }

    void sol() {
        constexpr int K = 21;
        st.assign(K, vv<int>(n-1,0));
        st[0] = lc;
        for (int j = 0; j < K - 1; j++) {
            for (int i = 0; i + (2 << j) <= n - 1; i++) {
                st[j + 1][i] = std::min(st[j][i], st[j][i + (1 << j)]);
            }
        }
    }

    int rmq(int l, int r) {
        int k = std::__lg(r - l);
        return std::min(st[k][l], st[k][r - (1 << k)]);
    }

    int lcp(int i, int j) {
        if (i == j || i == n || j == n) {
            return std::min(n - i, n - j);
        }
        int a = rk[i];
        int b = rk[j];
        if (a > b) {
            std::swap(a, b);
        }
        return std::min({n - i, n - j, rmq(a, b)});
    }
};

int sum = 0, com = 0;

void do_(string &s1, string &s2) {
    int n = sz(s1), m = sz(s2);
    SA sa(s1);
    sa.sol();
    string s3 = s1 + "#" + s2;
    reverse(s3.begin(), s3.end());
    SA sar(s3);
    sar.sol();

    auto lcp = [&](int i, int j) {
        return sa.lcp(i - 1, j - 1);
    };
    auto lcs = [&](int i, int j) {
        return sar.lcp(n + m - i + 1, m - j);
    };
    vv pre(n + 5, vv<int>(min(n, m) + 5));
    rep(i, 1, n) {
        rep(j, 1, m) {
            if (lcs(i, j)) {
                com += lcs(i, j);
            }
            int x = lcs(i, j);
            pre[i][1]++;pre[i][x+1]--;
        }
        rep(j, 1, min(n, m) + 4) {
            pre[i][j] += pre[i][j - 1];
        }
        rep(j,1,min(n,m)+4){
            pre[i][j] += pre[i][j - 1];
        }
    }
    rep(l1, 1, n) {
        rep(l2, l1 + 2, n) {
            int x = lcp(l1, l2);
            if (!x) continue;
            int lim1=min(l2-l1-1,x);
            int lo=l2-l1-lim1;
            int ro=min(min(n,m),l2-l1-1);
            if(lo>ro) continue;
            sum+=pre[l2-1][ro]-pre[l2-1][lo-1];
            //cout<<l1<<" "<<l2<<" "<<lo<<" "<<ro<<" "<<pre[l2-1][ro]-pre[l2-1][lo-1]<<endl;
        }
    }
}

void solve() {
    string s1, s2;
    cin >> s1 >> s2;

    do_(s1, s2);
    swap(s1, s2);
    do_(s1, s2);
    cout << sum + com / 2;
}

signed main() {
    IOS
    int32_t tt = 1;
    //cin >> tt;
    rep(kase, 1, tt) solve();
}