#include<bits/stdc++.h>
#define int long long
#define ll long long
#define db double
#define pii pair<int, int>
using namespace std;
const int maxn = 6e3 + 10;
struct exKMP {
    int z[maxn];
    void get_z(string& c) {
        int len = c.length();
        int p = 0, k = 1, l;
        z[0] = len;
        while (p + 1 < len && c[p] == c[p + 1])
            p++;
        z[1] = p;
        for (int i = 2; i < len; i++) {
            p = k + z[k] - 1;
            l = z[i - k];
            if (i + l <= p)
                z[i] = l;
            else {
                int j = max(0ll, p - i + 1);
                while (i + j < len && c[i + j] == c[j])
                    j++;
                z[i] = j;
                k = i;
            }
        }
    }
} Z;
map<pii, int> mps, mpt;
const int base = 131, mod1 = 998244353, mod2 = 1e9 + 7;
int mi1[maxn], mi2[maxn];
pii h1[maxn], h2[maxn];
pii get_hash(pii h[], int l, int r) {
    l--;
    pii res;
    res.first = ((h[r].first - h[l].first * mi1[r - l]) % mod1 + mod1) % mod1;
    res.second = ((h[r].second - h[l].second * mi2[r - l]) % mod2 + mod2) % mod2;
    return res;
}
int sub[maxn][maxn];
int cal(string s, string t, int id) {
    int n = s.length(), m = t.length();
    for (int i = 1; i <= n; i++) {
        h1[i].first = (h1[i - 1].first * base + s[i - 1]) % mod1;
        h1[i].second = (h1[i - 1].second * base + s[i - 1]) % mod2;
    }
    for (int i = 1; i <= m; i++) {
        h2[i].first = (h2[i - 1].first * base + t[i - 1]) % mod1;
        h2[i].second = (h2[i - 1].second * base + t[i - 1]) % mod2;
    }
    for (int i = 1; i <= n; i++)
        for (int j = i; j <= n; j++) 
            mps[get_hash(h1, i, j)]++;
    for (int i = 1; i <= m; i++)
        for (int j = i; j <= m; j++)
            mpt[get_hash(h2, i, j)]++;
    int ans = 0;
    if (id == 0) {
    for (auto it : mps)
        ans += it.second * mpt[it.first];
    }
    // cout << "same" << ans << endl;
    for (int i = 1; i <= n; i++) {
        string str2 = s.substr(i - 1);
        Z.get_z(str2);
        for (int j = 3; j <= str2.length(); j++) {
            int mxlen = min(Z.z[j - 1], j - 1);
            if (!mxlen) continue;
            // 右端点在 j - 1, 左端点在 2 到 mxlen + 1
            sub[i - 1 + j - 1][i - 1 + 2]++;
            sub[i - 1 + j - 1][i - 1 + mxlen + 1 + 1]--;
        }
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= i; j++) {
            sub[i][j] += sub[i][j - 1];
            if (sub[i][j] > 0) {
                ans += sub[i][j] * mpt[get_hash(h1, j, i)];
                // cout << "l, r = " << j << " " << i << endl;
            }
        }
    return ans;
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    mi1[0] = mi2[0] = 1;
    for (int i = 1; i < maxn; i++) {
        mi1[i] = mi1[i - 1] * base % mod1;
        mi2[i] = mi2[i - 1] * base % mod2;
    }
    string s, t;
    cin >> s >> t;
    int res = cal(s, t, 0);
    memset(sub, 0, sizeof sub);
    mps.clear();
    mpt.clear();
    res += cal(t, s, 1);
    cout << res << endl;
    return 0;
}