#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
using namespace std;
int d[1000][1000];
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
string s1,s2;
int i,j,n1,n2;
while(cin>>s1>>s2){
n1=s1.length();
n2=s2.length();
memset(d,0,sizeof(d));
for(i=0;i<n1;i++)
for(j=0;j<n2;j++)
{
if(s1[i]==s2[j])
d[i+1][j+1]=d[i][j]+1;
else
d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);
}
printf("%d\n",d[n1][n2]);
}
return 0;
}
#include<stdlib.h>
#include<string.h>
#include<string>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
using namespace std;
int d[1000][1000];
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
string s1,s2;
int i,j,n1,n2;
while(cin>>s1>>s2){
n1=s1.length();
n2=s2.length();
memset(d,0,sizeof(d));
for(i=0;i<n1;i++)
for(j=0;j<n2;j++)
{
if(s1[i]==s2[j])
d[i+1][j+1]=d[i][j]+1;
else
d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);
}
printf("%d\n",d[n1][n2]);
}
return 0;
}