#include<iostream>
#include<algorithm>
#include<fstream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
#include<cctype>
#include<vector>
#include<limits.h>
#include<queue>
using namespace std;
char s1[1000];
char s2[1000];
int dp[1000][1000];
int main()
{
int i,j;
while(scanf("%s %s",s1,s2)==2)
{
int len1=strlen(s1);
int len2=strlen(s2);
for(i=1;i<=len1;++i)
{
for(j=1;j<=len2;++j)
{
if(s1[i-1]==s2[j-1])
dp[i][j]=dp[i-1][j-1]+1;
else
{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
int ans=dp[len1][len2];
printf("%d\n",ans);
}
return 0;
}