#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int B=10007;
int lcp[5005][5005];
int pre[5005];
void BellaKira()
{
    int ans=0;
    string s,t;
    cin>>s>>t;
    {
        unordered_map<ull,int>Mp;
        for (int i=0;i<t.size();i++)
        {
            ull x=0;
            for (int j=i;j>=0;j--)
            {
                x=x*B+t[j];
                Mp[x]++;
            }
        }
        for (int i=sz(s)-1;i>=0;i--)
            for (int j=sz(s)-1;j>=0;j--)
            {
                if (s[i]==s[j]) lcp[i][j]=lcp[i+1][j+1]+1;
            }
        for (int j=0;j<=sz(s);j++)
        {
            for (int i=0;i<=sz(s);i++)
                pre[i]=0;
            for (int i=0;i+1<j;i++)
                if (lcp[i][j])
                {
                    pre[i+1]++;
                    pre[i+lcp[i][j]+1]--;
                }
            for (int i=0;i<j;i++)
            {
                if (i) pre[i]=(pre[i]+pre[i-1]);
            }
            ull x=0;
            for (int i=j-1;i>=0;i--)
            {
                int coef=1+pre[i];
                x=x*B+s[i];
                ans+=coef*Mp[x];
                // cout<<i<<" "<<j-1<<" "<<coef<<" "<<Mp[x]<<endl;
            }
        }
    }
        for (int i=sz(s)-1;i>=0;i--)
            for (int j=sz(s)-1;j>=0;j--) lcp[i][j]=0;
    swap(s,t);
    {
        unordered_map<ull,int>Mp;
        for (int i=0;i<t.size();i++)
        {
            ull x=0;
            for (int j=i;j>=0;j--)
            {
                x=x*B+t[j];
                Mp[x]++;
            }
        }
        for (int i=sz(s)-1;i>=0;i--)
            for (int j=sz(s)-1;j>=0;j--)
            {
                if (s[i]==s[j]) lcp[i][j]=lcp[i+1][j+1]+1;
            }
        for (int j=0;j<=sz(s);j++)
        {
            for (int i=0;i<=sz(s);i++)
                pre[i]=0;
            for (int i=0;i+1<j;i++)
                if (lcp[i][j])
                {
                    pre[i+1]++;
                    pre[i+lcp[i][j]+1]--;
                }
            for (int i=0;i<j;i++)
            {
                if (i) pre[i]=(pre[i]+pre[i-1]);
            }
            ull x=0;
            for (int i=j-1;i>=0;i--)
            {
                int coef=pre[i];
                x=x*B+s[i];
                ans+=coef*Mp[x];
                // cout<<i<<" "<<j-1<<" "<<coef<<" "<<Mp[x]<<endl;
            }
        }
    }
    cout<<ans<<'\n';


}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/