#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>

using namespace std;

const int N = 2010;

struct Atom {
    char ch, mark;
};

string a, b;
Atom x[N], y[N];
int f[N][N], n, m;

void ChMin(int &x, int y) {
    x = min(x, y);
}

int Parse(const string &s, Atom atom[]) {
    int sz = 0, len = s.size();
    for (int i = 0; i < len; ++i) {
        ++sz;
        atom[sz] = { s[i], 0 };
        if (i + 1 < len && (s[i + 1] == '?' || s[i + 1] == '*')) {
            atom[sz].mark = s[++i];
        }
    }
    return sz;
}

int main() {
    cin >> a >> b;
    n = Parse(a, x), m = Parse(b, y);
    memset(f, 0x3f, sizeof(f));
    f[0][0] = 0;
    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j <= m; ++j) {
            if (i < n) ChMin(f[i + 1][j], f[i][j] + (x[i + 1].mark == 0));
            if (j < m) ChMin(f[i][j + 1], f[i][j] + (y[j + 1].mark == 0));
            if (i < n && j < m) {
                int ni = i + (x[i + 1].mark != '*');
                int nj = j + (y[j + 1].mark != '*');
                if (ni != i || nj != j) {
                    ChMin(f[ni][nj], f[i][j] + (x[i + 1].ch != y[j + 1].ch));
                }
            }
        }
    }

    printf("%d\n", f[n][m]);

    return 0;
}