#include <bits/stdc++.h>
using namespace std;
string s;
string a;
string t = "";
vector<pair<long long, long long>> y;
long p = 0;
long z = 0, v;
void find() {
  for (; z < v; z++) {
    if (a[z] == s[p]) {
      p++;
    }
    if (p == s.size()) {
      y.push_back(make_pair(z - p + 1, z));
      z++;
      return;
    }
  }
}
void find_r() {
  for (; z < v; v--) {
    if (a[v] == s[p]) {
      p--;
    }
    if (p == -1) {
      y.push_back(make_pair(v, v + s.size() - 1));
      v--;
      return;
    }
  }
}
int main() {
  cin >> s;
  cin >> a;
  v = a.size() - 1;
  while (z < v) {
    if (y.size() % 2 == 0) {
      p = 0;
      find();
    } else {
      p = s.size() - 1;
      find_r();
      break;
    }
  }
  y.push_back(make_pair(0, 0));
  y.pop_back();
  if (y.size() < 2)
    p = 0;
  else {
    p = (y[1].first - y[0].second);
  }
  cout << p;
  return 0;
}
