#include <bits/stdc++.h>
using namespace std;
const long long int logx = 30;
const long long int N = 1e6 + 5;
const long long int M = 3e5 + 5;
const long long int mod = 1e9 + 7;
const long long int INF = 9e18 + 5;
const double PI = 3.14159265;
inline long long int mul(long long int a, long long int b) {
  return (a * 1ll * b) % mod;
}
inline long long int sub(long long int a, long long int b) {
  long long int c = a - b;
  if (c < 0) c += mod;
  return c;
}
inline long long int add(long long int a, long long int b) {
  long long int c = a + b;
  if (c >= mod) c -= mod;
  return c;
}
template <typename T>
T power(T x, T y, long long int m) {
  T ans = 1;
  while (y > 0) {
    if (y & 1LL) ans = (ans * x) % m;
    y >>= 1ll;
    x = (x * x) % m;
  }
  return ans % m;
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  string second, t;
  cin >> second >> t;
  long long int n = second.length();
  long long int m = t.length();
  long long int premax = INF, sufmin = -INF, j = 0;
  for (long long int i = 0; i < m; i++) {
    if (t[i] == second[j]) {
      premax = i;
      j++;
    }
    if (j == n) {
      break;
    }
  }
  if (j != n) {
    cout << 0 << endl;
    exit(0);
  }
  j = n - 1;
  for (long long int i = m - 1; i >= 0; i--) {
    if (t[i] == second[j]) {
      sufmin = i;
      j--;
    }
    if (j == -1) {
      break;
    }
  }
  if (premax >= sufmin) {
    cout << 0 << endl;
    exit(0);
  }
  cout << sufmin - premax << endl;
}
