#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
char a[5050],b[5050];
int s[5050][5050];
int main()
{
	freopen("lcslength.in","r",stdin);
	freopen("lcslength.out","w",stdout);
	int l=1;
	while(a[l-1]!='.'){
	  scanf("%c",&a[l]);
	  l++;
	 }
	int k=1;
	while(a[k-1]!='.'){
	  scanf("%c",&b[k]);
	  k++;
	 }
	l-=2;k-=2;
	for(int i=1;i<=l;i++)
	  for(int j=1;j<=k;j++)
	   {
	   	if(a[i]==b[j])s[i][j]=s[i-1][j-1]+1;
	   	else s[i][j]=max(s[i-1][j],s[i][j-1]);
	   }
	cout<<s[l][k];
}