#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
using u128=__uint128_t;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=2*5010;
const int maxalp=26;
int trans[maxn][maxalp],cnt[maxn],len[maxn],link[maxn],nodecnt,lastnode;


void append(int c){

    int curr=lastnode;
    int newn=nodecnt++;
    cnt[newn]=1;
    len[newn]=len[curr]+1;
    lastnode=newn;

    while(curr!=-1 && trans[curr][c]==-1){
        trans[curr][c]=newn;
        curr=link[curr];
    }

    if(curr==-1){
        link[newn]=0;
        return;
    }

    int q=trans[curr][c];
    if(len[curr]+1==len[q]){
        link[newn]=q;
        return;
    }

    int clone=nodecnt++;
    for(int i=0;i<maxalp;i++)trans[clone][i]=trans[q][i];
    link[clone]=link[q];
    link[q]=link[newn]=clone;
    len[clone]=len[curr]+1;
    cnt[clone]=0;

    while(curr!=-1 && trans[curr][c]==q){
        trans[curr][c]=clone;
        curr=link[curr];
    }

}
void build(string &s){

    memset(trans,-1,sizeof(trans) );
    for(int i=0;i<maxn;i++){
        cnt[i]=0;
        len[i]=0;
        link[i]=-1;
    }
    nodecnt=1;
    lastnode=0;

    for(int i=0;i<s.size();i++)
        append(s[i]-'a');


    vector<pii>nodes;
    for(int i=0;i<nodecnt;i++){
        nodes.pb({-len[i],i});
    }
    sort(nodes.begin(),nodes.end());
    for(int i=0;i<nodes.size();i++){
        int x=nodes[i].ss;
        cnt[link[x]]+=cnt[x];
    }

}

/// NE SMES UZETI DA JE SVE IZ JEDNOG STRINGA
vector<int> getZ(string s,string p){

    s=p+'$'+s;

    int l=0;
    int r=0;

    vector<int>Z(s.size());
    for(int i=1;i<s.size();i++){


        if(i>r){

            l=i;
            r=l-1;

            while(r+1<s.size() && s[r+1]==s[r+1-l])r++;

            Z[i]=r-l+1;

        }
        else{

            if(i+Z[i-l]-1<r)Z[i]=Z[i-l];
            else{
                l=i;
                while(r+1<s.size() && s[r+1]==s[r+1-l])r++;
                Z[i]=r-l+1;
            }

        }

    }

    vector<int>ret;
    for(int i=p.size()+1;i<s.size();i++)ret.pb(Z[i]);
    return ret;
}


ll solve_mid(string a,string b){

    string revb=b;
    reverse(revb.begin(),revb.end());
    //printf("DOSO\n");
    build(revb);
    //printf("DOSO2\n");


    ll ret=0;
    vector<int>niz(a.size()+4),ocur(a.size()+4);
    for(int i=2;i<a.size();i++){

        string p,s;
        for(int j=i;j<a.size();j++)p.pb(a[j]);
        for(int j=0;j<i;j++)s.pb(a[j]);

        //printf("%d LL\n",i);
        vector<int>Z=getZ(s,p);
        //printf("%d ZZ\n",i);
        for(int j=0;j<niz.size();j++)niz[j]=0;

        for(int j=0;j<i;j++){
            niz[j+1]++;
            niz[j+Z[j]+1]--;
        }

        int curr=0;
        for(int j=0;j<i;j++){
            curr+=niz[j];
            ocur[j]=curr;
        }

        int x=0;
        for(int j=i-1;j>=0;j--){
            x=trans[x][a[j]-'a'];
            if(x==-1)break;
            ret+=(ll)cnt[x]*(ll)ocur[j];
        }

    }
    ///printf("DOSO3\n");

    return ret;
}

ll solve_reg(string a,string b){

    build(b);
    ll ret=0;
    for(int i=0;i<a.size();i++){
        int x=0;
        for(int j=i;j<a.size();j++){
            x=trans[x][a[j]-'a'];
            if(x==-1)break;
            ret+=(ll)cnt[x];
        }
    }
    return ret;
}

int main(){

    ///freopen("test.txt","r",stdin);

    string a,b;

    cin>>a>>b;

    ll ret=solve_mid(a,b);
    ret+=solve_mid(b,a);

    ret+=solve_reg(a,b);

    ///printf("%d AA\n",solve_reg(a,b));

    printf("%lld\n",ret);

    return 0;
}