#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    p /= 2;
  }
  return ret;
}
long long power(long long a, long long p) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a);
    a = (a * a);
    p /= 2;
  }
  return ret;
}
int main() {
  int i, j, tmp;
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  string p, s;
  cin >> p >> s;
  int lp = p.length(), ls = s.length(), pos1, pos2;
  j = 0;
  for (i = 0; i < ls; i++) {
    if (s[i] == p[j]) j++;
    if (j == lp) break;
  }
  pos1 = i;
  j = lp - 1;
  for (i = ls - 1; i >= 0; i--) {
    if (s[i] == p[j]) j--;
    if (j == -1) break;
  }
  pos2 = i;
  if (pos2 <= pos1)
    cout << 0 << endl;
  else
    cout << pos2 - pos1 << endl;
  return 0;
}
