# include <bits/stdc++.h>

using namespace std;

constexpr int N(5010);

long long clc(char const* s, char const* t, int w) {
  int m(strlen(s + 1));
  int n(strlen(t + 1));
  static long long f[N][N];
  static long long g[N][N];
  for (int i(n); i >= 1; --i)
    for (int j(m); j >= 1; --j)
      f[i][j] = t[i] == s[j] ? f[i + 1][j + 1] + 1 : 0;
  for (int i(1); i <= n; ++i)
    for (int j(1); j <= m; ++j)
      if (f[i][j]) ++g[j][f[i][j]];
  memset(f, 0x00, sizeof f);
  for (int i(1); i <= m; ++i)
    for (int j(m); j != 1; --j)
      g[i][j - 1] += g[i][j];
  for (int i(1); i <= m; ++i)
    for (int j(1); j <= m; ++j)
      if (g[i][j]) f[i][i + j - 1] += g[i][j];
  memset(g, 0x00, sizeof g);
  for (int i(m); i >= 1; --i)
    for (int j(m); j >= 1; --j)
      g[i][j] = s[i] == s[j] ? g[i + 1][j + 1] + 1 : 0;
  long long a(0), b(0);
  for (int i(1); i <= m; ++i)
    for (int j(i); j <= m; ++j)
      b += f[i][j];
  for (int i(1); i != m; ++i)
    for (int j(1); j <= m; ++j)
      f[i + 1][j] += f[i][j];
  for (int i(1); i <= m; ++i)
    for (int j(i + 2); j <= m; ++j)
      if (g[i][j]) {
        int l(i + 1), r(min(i + g[i][j], j - 1ll));
        a += f[r][j - 1] - f[l - 1][j - 1];
      }
  memset(f, 0x00, sizeof f);
  memset(g, 0x00, sizeof g);
  return a + w * b;
}

int main() {
  static char s[N];
  static char t[N];
  cin >> (s + 1);
  cin >> (t + 1);
  long long ans(0);
  ans += clc(s, t, 1), swap(s, t);
  ans += clc(s, t, 0), swap(s, t);
  cout << ans << endl;
}