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

#define all(x) begin(x),end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int inf = 1e9;

int gao(const string &S, const string &T) {
  if (T.size() == 1) {
    if (S[0] == T[0]) {
      return 1;
    } else {
      return inf;
    }
  }

  const int N = (int)S.size(), M = (int)T.size();
  {
    bool only_two = true;
    for (char c : T) if (c != T[0] && c != T[1]) only_two = false;
    if (only_two) {
      if (N >= 2) {
        if (S[0] == T[0] && S[1] == T[1]) return 2;
        if (S[0] == T[1] && S[1] == T[0]) return 2;
      }
      return inf;
    }
  }

  int i = 0;
  int j = 0;
  while (true) {
    if (S[i] != T[j])
      return inf;
    assert(j + 1 < M);

    if (i + 1 == N || S[i + 1] != T[j + 1])
      return inf;

    assert(i + 1 < N && j + 1 < M);
    assert(S[i] == T[j]);
    assert(S[i + 1] == T[j + 1]);

    const char c[2] = {S[i], S[i + 1]};
    int a = 0, b = 0;
    while (i + a < N && S[i + a] == c[a % 2])
      ++a;
    while (j + b < M && T[j + b] == c[b % 2])
      ++b;

    if (j + b == M)
      return i + 2;
    // i + a = C
    // j + b = C
    if (a > b)
      return inf;
    i = i + a - 1;
    j = j + b - 1;
  }
}

signed main() {
  cin.tie(nullptr) -> sync_with_stdio(false);

  string S, T;
  cin >> S >> T;


  T.erase(unique(all(T)), end(T));

  const int N = (int)S.size();
  vector<int> R(N);
  for (int sft = 0; sft < N; sft++) {
    R[sft] = sft + gao(S.substr(sft), T);
  }

  orange(all(R));
  for (int i = N - 2; i >= 0; i--) {
    R[i] = min(R[i], R[i + 1]);
  }
  orange(all(R));

  int ans = 0;
  for (int i = 0; i < N; i++) {
    ans += max(0, N + 1 - R[i]);
  }
  cout << ans << '\n';

  // ATGTG
  // TG

  // ATG
}