#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b) { return a < b ? a = b, 1 : 0; }

struct IOSetup
{
  IOSetup()
  {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a)
{
  for (auto x : a)
    cout << x << ' ';
  cout << endl;
}

void print(auto x) { cout << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail)
{
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

mt19937_64 rng(2024); // [0, 2^64)
ll randint(ll l, ll r) { return l + rng() % (r - l + 1); }


ll calc1(string s,string t){
  int ns=s.size(),nt=t.size();
  vvi lcp(ns+1,vi(ns+1,0));
  for(int i=ns-1;i>=0;i--){
    for(int j=ns-1;j>=0;j--){
      if(s[i]==s[j])lcp[i][j]=lcp[i+1][j+1]+1;
      else lcp[i][j]=0;
    }
  }


  // dp[l][r] := XYX (Y = s[l:r)) となる非空な X の個数
  vvi dp(ns+1,vi(ns+1,0));
  rep2(r,1,ns+1){
    vi imos(ns+1);
    rep(l,r){
      imos[l+1]++;
      imos[l+lcp[l][r]+1]--;
      if(l>0)imos[l+1]+=imos[l];
      dp[l][r]=imos[l];
    }
  }

  vvi lcp2(ns+1,vi(nt+1,0)); // lcp2[i][j] = LCP(s[i:], t[j:])
  for(int i=ns-1;i>=0;i--)for(int j=nt-1;j>=0;j--){
    if(s[i]==t[j])lcp2[i][j]=lcp2[i+1][j+1]+1;
    else lcp2[i][j]=0;
  }
  ll ans=0;
  rep(l,ns){
    vi cum(ns+1);
    rep(i,nt)cum[lcp2[l][i]]++;
    int sm=0;
    for(int r=ns;r>l;r--){
      sm+=cum[r-l];
      ans+=sm*dp[l][r];
    }
  }
  return ans;
}

ll calc2(string s,string t){
  int ns=s.size(),nt=t.size();
  vvi lcp2(ns+1,vi(nt+1,0)); // lcp2[i][j] = LCP(s[i:], t[j:])
  ll ans=0;
  for(int i=ns-1;i>=0;i--)for(int j=nt-1;j>=0;j--){
    if(s[i]==t[j])lcp2[i][j]=lcp2[i+1][j+1]+1;
    else lcp2[i][j]=0;
    ans+=lcp2[i][j];
  }
  return ans;  
}

ll solve(string s,string t){
  ll ans=calc1(s,t)+calc1(t,s)+calc2(s,t);
  return ans;
}

ll naive(string s,string t){
  ll ans=0;
  int n=s.size();
  int m=t.size();
  rep(ls,n){
    rep2(rs,ls,n){
      string s0=s.substr(ls,rs-ls+1);
      rep(lt,m){
        rep2(rt,lt,m){
          string t0=t.substr(lt,rt-lt+1);
          string x=s0+t0;
          int k=x.size();
          if(k%2==0&&x.substr(0,k/2)==x.substr(k/2,k/2)){
            ans++;
          }
        }
      }
    }
  }
  return ans;
}

string gen(){
  string s;
  int n=randint(1,30);
  rep(i,n){
    s+='a'+randint(0,5);
  }
  return s;
}

int main(){
  while(0){
    string s=gen(),t=gen();
    print(s,t,solve(s,t),naive(s,t));
    assert(solve(s,t)==naive(s,t));
  }
  string s,t;
  cin>>s>>t;
  cout<<solve(s,t)<<endl;
}