#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int dp[2020][2020];
vector<string>f()
{
	string s;cin>>s;
	vector<string>A;
	for(int i=0;i<s.size();i++)
	{
		if(i+2<=s.size()&&(s[i+1]=='?'||s[i+1]=='*'))
		{
			A.push_back(s.substr(i,2));
			i++;
		}
		else A.push_back(s.substr(i,1));
	}
	return A;
}
main()
{
	vector<string>A=f(),B=f();
	for(int i=0;i<=A.size();i++)for(int j=0;j<=B.size();j++)dp[i][j]=1e9;
	dp[0][0]=0;
	for(int i=0;i<=A.size();i++)for(int j=0;j<=B.size();j++)
	{
		if(i<A.size())dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(A[i].size()>1?0:1));
		if(j<B.size())dp[i][j+1]=min(dp[i][j+1],dp[i][j]+(B[j].size()>1?0:1));
		if(i<A.size()&&j<B.size())
		{
			dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+(A[i][0]!=B[j][0]));
			if(A[i][0]==B[j][0])
			{
				if(A[i][1]=='*')dp[i][j+1]=min(dp[i][j+1],dp[i][j]);
				if(B[j][1]=='*')dp[i+1][j]=min(dp[i+1][j],dp[i][j]);
			}
		}
	}
	cout<<dp[A.size()][B.size()]<<endl;
}