#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, const T &y) {
  x = min(x, y);
}
constexpr int MAXLEN = 5010, MAXTOT = 1e4 + 10, INF = 0x3f3f3f3f;
int tpn, tpo, tot, dis[MAXTOT][MAXTOT];
bitset<MAXTOT> vis[MAXTOT];
char stko[MAXLEN];
pair<int, int> stkn[MAXLEN];
vector<pair<int, char>> g[MAXTOT];
deque<pair<int, int>> qu;
pair<int, int> new_node(const string &expr) {
  int x = ++tot, y = ++tot;
  for (auto c : expr) g[x].emplace_back(y, c);
  return {x, y};
}
pair<int, int> repeat(const pair<int, int> &u) {
  int x = ++tot, y = ++tot;
  g[x].emplace_back(u.first, '\0');
  g[u.second].emplace_back(y, '\0');
  g[u.second].emplace_back(u.first, '\0');
  return {x, y};
}
pair<int, int> concat(const pair<int, int> &u, const pair<int, int> &v) {
  g[u.second].emplace_back(v.first, '\0');
  return {u.first, v.second};
}
pair<int, int> alter(const pair<int, int> &u, const pair<int, int> &v) {
  int x = ++tot, y = ++tot;
  g[x].emplace_back(u.first, '\0');
  g[x].emplace_back(v.first, '\0');
  g[u.second].emplace_back(y, '\0');
  g[v.second].emplace_back(y, '\0');
  return {x, y};
}
void push(char op) {
  if (op == '+') {
    stkn[tpn] = repeat(stkn[tpn]);
  } else if (op == '*') {
    stkn[tpn - 1] = concat(stkn[tpn - 1], stkn[tpn]);
    --tpn;
  } else {
    assert(op == '|');
    stkn[tpn - 1] = alter(stkn[tpn - 1], stkn[tpn]);
    --tpn;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  string expr, tar;
  cin >> expr >> tar;
  for (int i = 0; i < (int)expr.size(); ++i) {
    if (i && (expr[i] == '(' || isdigit(expr[i]) || expr[i] == '[') && (expr[i - 1] != '|' && expr[i - 1] != '(')) {
      while (tpo && stko[tpo] != '(' && stko[tpo] != '|') push(stko[tpo--]);
      stko[++tpo] = '*';
    }
    if (isdigit(expr[i])) {
      stkn[++tpn] = new_node(string{expr[i]});
    } else if (expr[i] == '[') {
      int j = expr.find(']', i);
      stkn[++tpn] = new_node(expr.substr(i + 1, j - i - 1));
      i = j;
    } else if (expr[i] == '(') {
      stko[++tpo] = '(';
    } else if (expr[i] == ')') {
      while (stko[tpo] != '(') push(stko[tpo--]);
      --tpo;
    } else if (expr[i] == '+') {
      while (tpo && stko[tpo] == '+') push(stko[tpo--]); 
      stko[++tpo] = '+';
    } else {
      assert(expr[i] == '|');
      while (tpo && stko[tpo] != '(') push(stko[tpo--]);
      stko[++tpo] = '|';
    }
  }
  while (tpo) push(stko[tpo--]);
  assert(tpn == 1);
  int s, t;
  tie(s, t) = stkn[1];
  memset(dis, 0x3f, sizeof(dis));
  dis[s][0] = 0;
  qu.emplace_back(s, 0);
  while (!qu.empty()) {
    int x, y;
    tie(x, y) = qu.front();
    qu.pop_front();
    if (vis[x][y]) continue;
    if (x == t && y == (int)tar.size()) break;
    vis[x][y] = true;
    auto upd = [&](int nx, int ny, int d) {
      if (dis[x][y] + d < dis[nx][ny]) {
        dis[nx][ny] = dis[x][y] + d;
        if (d) {
          qu.emplace_back(nx, ny);
        } else {
          qu.emplace_front(nx, ny);
        }
      }
    };
    for (auto &i : g[x]) {
      upd(i.first, y, (bool)i.second);
      if (y != (int)tar.size()) upd(i.first, y + 1, tar[y] != i.second);
    }
    if (y != (int)tar.size()) upd(x, y + 1, 1);
  }
  cout << dis[t][tar.size()] << "\n";
  return 0;
}
/*
g++ whisper.cpp -o whisper -std=c++14 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/