#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

vector<pair<char, int>> a, b;
int A, B, dp[2002][2002], INF = 5000;

vector<pair<char, int>> f(string s) {
	vector<pair<char, int>> v;
	s += "@";
	inc(i, SI(s) - 1) {
		int t = 0;
		if(s[i + 1] == '?') { t = 1; }
		if(s[i + 1] == '*') { t = 2; }
		v.EB(s[i], t);
		
		if(t != 0) { i++; }
	}
	
	return v;
}

int main() {
	{
		string sa, sb;
		cin >> sa >> sb;
		a = f(sa);
		b = f(sb);
	}
	A = SI(a);
	B = SI(b);
	a.EB('@', 0);
	b.EB('@', 0);
	
	incII(i, 0, A) {
	incII(j, 0, B) {
		dp[i][j] = INF;
	}
	}
	dp[0][0] = 0;
	incII(i, 0, A) {
	incII(j, 0, B) {
		setmin(dp[i + 1][j], dp[i][j] + (a[i].SE == 0 ? 1 : 0));
		setmin(dp[i][j + 1], dp[i][j] + (b[j].SE == 0 ? 1 : 0));
		if(a[i].SE != 0 && b[j].SE != 0) { setmin(dp[i + 1][j + 1], dp[i][j]); }
		if(a[i].SE != 2 && b[j].SE != 2) { setmin(dp[i + 1][j + 1], dp[i][j] + (a[i].FI == b[j].FI ? 0 : 1)); }
		if(a[i].SE == 0 && b[j].SE == 2) { setmin(dp[i + 1][j + 0], dp[i][j] + (a[i].FI == b[j].FI ? 0 : 1)); }
		if(a[i].SE == 2 && b[j].SE == 0) { setmin(dp[i + 0][j + 1], dp[i][j] + (a[i].FI == b[j].FI ? 0 : 1)); }
	}
	}
	
	cout << dp[A][B] << endl;
	
	return 0;
}