#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}

/**
 * template name: zAlgo
 * author: Misuki
 * last update: 2022/02/04
 */

vector<int> build(string s) {
  vector<int> z(ssize(s));
  z[0] = s.size();
  for(int i = 1, l = 0, r = -1; i < s.size(); i++) {
    if (i <= r)
      z[i] = min(r - i + 1, z[i - l]);
    while(i + z[i] < s.size() and s[i + z[i]] == s[z[i]])
      l = i, r = i + z[i], z[i] += 1;
  }
  return z;
}

int cnt[5001][5001];

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  //int tc; cin >> tc;
  //while(tc--) {
  string s, t; cin >> s >> t;
  
  auto calc = [](string s, string t, bool flag) -> int {
    for(int i = 0; i < 5001; i++)
      fill(cnt[i], cnt[i] + 5001, 0);

    for(int i = 0; i < ssize(t); i++) {
      auto z = build(t.substr(i) + '#' + t);
      for(int j = i + 1; j < ssize(t); j++)
        if (int l = min(z[j + (ssize(t) - i + 1)], j - i - 1); l + flag > 0) {
          cnt[i + l][j - (i + l)]++, cnt[i][j - i]--;
          //cout << i << ' ' << j << ' ' << l << '\n';
        }
    }

    for(int i = ssize(t); i > 0; i--)
      for(int j = 0; j < ssize(t); j++)
        cnt[i - 1][j + 1] += cnt[i][j];
    /*
    for(int i = 0; i <= ssize(t); i++)
      for(int j = 0; j <= ssize(t); j++)
        cout << cnt[i][j] << " \n"[j == ssize(t)];
    */
    for(int i = 0; i <= ssize(t); i++)
      partial_sum(cnt[i], cnt[i] + ssize(t) + 1, cnt[i]);

    int ans = 0;
    for(int i = 0; i < ssize(s); i++) {
      auto z = build(s.substr(i) + '#' + t);
      for(int j = 0; j < ssize(t); j++)
        if (z[j + (ssize(s) - i + 1)])
          ans += cnt[j][z[j + (ssize(s) - i + 1)]];
    }

    return ans;
  };

  auto calc2 = [&](string s, string t) {
    int ans = 0;
    for(int i = 0; i < ssize(s); i++) {
      auto z = build(s.substr(i) + '#' + t);
      for(int j = 0; j < ssize(t); j++)
        ans += z[j + (ssize(s) - i + 1)];
    }
    return ans;
  };

  int ans = calc(s, t, false) + calc(t, s, false) + calc2(s, t);
  cout << ans << '\n';
  //}

  return 0;
}