// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=5005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
const int base=131;

int cnt[maxn][maxn],z[2*maxn];

long long cal(string &a,string &b,int t){
    int n=(int)a.length(),m=(int)b.length();
    for(int i=0;i<n;i++) for(int j=i;j<n;j++) cnt[i][j]=0;
    string s=a+"&"+b;
    int N=(int)s.length();
    long long res=0;
    for(int p=n-1;p>=0;p--){
        z[p]=0;
        for(int i=p+1,l=p+1,r=p;i<N;i++){
            z[i]=0;
            if(i<=r) z[i]=min(z[p+i-l],r-i+1);
            while(i+z[i]<N && s[p+z[i]]==s[i+z[i]]) z[i]++;
            if(i+z[i]-1>r) l=i,r=i+z[i]-1;
        }
        for(int i=n+1;i<N;i++) if(z[i]) cnt[p][p+z[i]-1]++;
        for(int i=n-1;i>=p;i--){
            if(i>p) cnt[p][i-1]+=cnt[p][i];
            cnt[p][i]+=cnt[p+1][i];
        }
        for(int i=p+1;i<=n;i++){
            int d=min(z[i],i-p-1);
            res+=cnt[p+t][i-1]-cnt[p+d+1][i-1];
        }
    }
    return res;
}

void solve(){
    string a,b;cin >> a >> b;
    long long res=cal(a,b,0);
    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
    res+=cal(b,a,1);
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}