#include<bits/stdc++.h>
using namespace std;
string s,t;
int b[2500]={0},a[200]={0};
int m,n;
int q=0,h=0;
void dfs1(int x,int y){
	q=max(q,y-1);
	if(x>m||y>n||q==n){
		return;
	}
	if(b[x]==a[y]){
		dfs1(x+1,y+1);
	}
	dfs1(x+1,1);
	return;
}
void dfs2(int x,int y){
	h=max(h,n-y);
	if(x==0||y==0||h==n){
		return;
	}
	if(b[x]==a[y]){
		dfs2(x-1,y-1);
	}
	dfs2(x-1,n);
	return;
}
int main(){
	freopen("cutstring.in","r",stdin);
	freopen("cutstring.out","w",stdout);
	cin>>s;
	m=s.length();
	for(int i=1;i<=m;i++){
		b[i]=s[i-1]-'a'+1;
	}
	cin>>t;
	n=t.length();
	for(int i=1;i<=n;i++){
		a[i]=t[i-1]-'a'+1;
	}
	dfs1(1,1);
	dfs2(m,n);
	h=n-h+1;
	if(q<h){
		return 0;
	}
	else if(q==n&&h==1){
		cout<<q-h<<endl;
		return 0;
	}
	else if(q==n||h==1){
		cout<<q-h+1<<endl;
		return 0;
	}
	cout<<q-h+2<<endl;
	fclose(stdin);
	fclose(stdout);
	return 0;
}