#include<stdio.h>
char s[100001],t[100001],mt[17][100001];
int solve(int x,int y)
{
	if(!s[x])
		return 114514;
	int z=y;
	while(s[x]<t[z])
		z++;
	if(t[z]<s[x])
		return z-y;
	int ans=solve(x+1,z+1)+z-y;
	for(int i=16;~i;i--)
		if(z+(1<<i)<=100001&&mt[i][z]>=s[x])
			z+=1<<i;
	return ans<z-y?ans:z-y;
}
int main()
{
	scanf("%s%s",s,t);
	for(int i=0;i<100001;i++)
		mt[0][i]=t[i];
	for(int i=0;i<16;i++)
		for(int j=0;j<=100001-(1<<i+1);j++)
			mt[i+1][j]=mt[i][j]<mt[i][j+(1<<i)]?mt[i][j]:mt[i][j+(1<<i)];
	printf("%d",solve(0,0));
	return 0;
}