#include<iostream>
#include<cstring>
#include<vector>
#include<random>
#include<unordered_map>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const int maxn = 5005;
static const ULL mod = (1ull << 61) - 1;
ULL power[maxn];
mt19937_64 rnd(random_device{}());
uniform_int_distribution<ULL> dist(100, mod - 1);
const ULL base = dist(rnd);

static inline ULL add(ULL a, ULL b){
    a += b;
    if (a >= mod) a -= mod;
    return a;
}

static inline ULL mul(ULL a, ULL b){
    __uint128_t c = __uint128_t(a) * b;
    return add(c >> 61, c & mod);
}

ULL merge(ULL h1, ULL h2, int len2){
    return add(mul(h1, power[len2]), h2);
}

void init(){
    power[0] = 1;
    for(int i = 1; i < maxn; i++)
        power[i] = mul(power[i - 1], base);
}

ULL query(const vector<ULL> &s, int l, int r){
    return add(s[r], mod - mul(s[l - 1], power[r - l + 1]));
}

vector<ULL> build(const string &s){
    int sz = s.size();
    vector<ULL> hashed(sz + 1);
    for (int i = 0; i < sz; i++){
        hashed[i + 1] = add(mul(hashed[i], base), s[i]);
    }
    return hashed;
}

template <typename T>
vector<ULL> build(const vector<T> &s){
    int sz = s.size();
    vector<ULL> hashed(sz + 1);
    for (int i = 0; i < sz; i++){
        hashed[i + 1] = add(mul(hashed[i], base), s[i]);
    }
    return hashed;
}

int lcp[maxn][maxn];
int c1[maxn][maxn], c2[maxn][maxn];


#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<chrono>
using namespace __gnu_pbds;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    init();
    string s, t;
    cin >> s >> t;
    auto hs = build(s), ht = build(t);
    const int n = s.size(), m = t.size();
    s = " " + s;
    t = " " + t;
    {
        for(int i = n; i >= 1; i--){
            for(int j = n; j >= 1; j--){
                if (s[i] == s[j]){
                    lcp[i][j] = lcp[i + 1][j + 1] + 1;
                    if (j > i){
                        c1[j - 1][i + 1] += 1;
                        c1[j - 1][min(j - 1, i + lcp[i][j]) + 1] -= 1;
                    }
                }
            }
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= i; j++){
                c1[i][j] += c1[i][j - 1];
            }
        }
    }
    {
        memset(lcp, 0, sizeof lcp);
        for(int i = m; i >= 1; i--){
            for(int j = m; j >= 1; j--){
                if (t[i] == t[j]){
                    lcp[i][j] = lcp[i + 1][j + 1] + 1;
                    if (j > i){
                        c2[j - 1][i + 1] += 1;
                        c2[j - 1][min(j - 1, i + lcp[i][j]) + 1] -= 1;
                    }
                }
            }
        }
        for(int i = 1; i <= m; i++){
            for(int j = 1; j <= i; j++){
                c2[i][j] += c2[i][j - 1];
            }
        }
    }

    LL ans = 0;
    {
        gp_hash_table<ULL, LL> mp;
        for(int i = 1; i <= n; i++){
            for(int j = i; j <= n; j++){
                mp[query(hs, i, j)] += c1[j][i] + 1;
            }
        }
        for(int i = 1; i <= m; i++){
            for(int j = i; j <= m; j++){
                ULL h = query(ht, i, j);
                if (mp.find(h) != mp.end()){
                    ans += mp[h];
                }
            }
        }
    }
    {
        gp_hash_table<ULL, LL> mp;
        for(int i = 1; i <= m; i++){
            for(int j = i; j <= m; j++){
                mp[query(ht, i, j)] += c2[j][i];
            }
        }
        for(int i = 1; i <= n; i++){
            for(int j = i; j <= n; j++){
                ULL h = query(hs, i, j);
                if (mp.find(h) != mp.end()){
                    ans += mp[h];
                }
            }
        }
    }
    cout << ans << '\n';

}