#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>

using namespace std;

const int maxn=1000100;
char s[maxn],t[maxn];
int dp[2][maxn];

int main()
{
    while(scanf("%s%s",s,t)!=EOF){
        int ls=strlen(s),lt=strlen(t);
        memset(dp,0,sizeof(dp));
        char *ss=s-1,*tt=t-1;
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=ls;i++){
            for(int j=1;j<=lt;j++){
                if(ss[i]==tt[j]) dp[i%2][j]=dp[(i+1)%2][j-1]+1;
                else dp[i%2][j]=max(dp[(i+1)%2][j],dp[i%2][j-1]);
            }
        }
        printf("%d\n",dp[ls%2][lt]);
    }
    return 0;
}