#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;
// uniform_int_distribution<ULL> dist(100, 1004535809 - 1);
const int base = 141431;

template<const int T>
struct ModInt {
    const static int mod = T;
    int x;
    ModInt(int x = 0) : x(x % mod) {}
    ModInt(long long x) : x(int(x % mod)) {} 
    int val() { return x; }
    ModInt operator + (const ModInt &a) const { int x0 = x + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
    ModInt operator - (const ModInt &a) const { int x0 = x - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
    ModInt operator * (const ModInt &a) const { return ModInt(1LL * x * a.x % mod); }
    ModInt operator / (const ModInt &a) const { return *this * a.inv(); }
    bool operator == (const ModInt &a) const { return x == a.x; };
    bool operator != (const ModInt &a) const { return x != a.x; };
    void operator += (const ModInt &a) { x += a.x; if (x >= mod) x -= mod; }
    void operator -= (const ModInt &a) { x -= a.x; if (x < 0) x += mod; }
    void operator *= (const ModInt &a) { x = 1LL * x * a.x % mod; }
    void operator /= (const ModInt &a) { *this = *this / a; }
    friend ModInt operator + (int y, const ModInt &a){ int x0 = y + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
    friend ModInt operator - (int y, const ModInt &a){ int x0 = y - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
    friend ModInt operator * (int y, const ModInt &a){ return ModInt(1LL * y * a.x % mod);}
    friend ModInt operator / (int y, const ModInt &a){ return ModInt(y) / a;}
    friend ostream &operator<<(ostream &os, const ModInt &a) { return os << a.x;}
    friend istream &operator>>(istream &is, ModInt &t){return is >> t.x;}

    ModInt pow(int64_t n) const {
        ModInt res(1), mul(x);
        while(n){
            if (n & 1) res *= mul;
            mul *= mul;
            n >>= 1;
        }
        return res;
    }
    
    ModInt inv() const {
        int a = x, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        if (u < 0) u += mod;
        return u;
    }
    
};
using mint = ModInt<1004535809>;

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);

    string s, t;
    cin >> s >> 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<int, LL> mp;
        for(int i = 1; i <= n; i++){
            mint h = 0;
            for(int j = i; j <= n; j++){
                h = h * base + int(s[j]);
                mp[h.val()] += c1[j][i] + 1;
            }
        }
        for(int i = 1; i <= m; i++){
            mint h = 0;
            for(int j = i; j <= m; j++){
                h = h * base + int(t[j]);
                if (mp.find(h.val()) != mp.end()){
                    ans += mp[h.val()];
                }
            }
        }
    }
    {
        gp_hash_table<int, LL> mp;
        for(int i = 1; i <= m; i++){
            mint h = 0;
            for(int j = i; j <= m; j++){
                h = h * base + int(t[j]);
                mp[h.val()] += c2[j][i];
            }
        }
        for(int i = 1; i <= n; i++){
            mint h = 0;
            for(int j = i; j <= n; j++){
                h = h * base + int(s[j]);
                if (mp.find(h.val()) != mp.end()){
                    ans += mp[h.val()];
                }
            }
        }
    }
    cout << ans << '\n';

}