#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
///abcdefg
///aceg - subsir
///abc def - subsecventa
/*
avem 2 siruri de caractere (de lungime maxima 1000 caractere)
sa se gaseasca cel mai lung subsir comun;
*/
char a[1025],b[1025];
int m[1025][1025];
int main()
{
    int j,i;
    fin >> a >> b;

   int N=strlen(a),M=strlen(b);

    if(a[0]==b[0])
    {
        m[0][0]=1;
    }
    else
        m[0][0]=0;
    for(i=1;i<N;i++)
    {
        if(a[i]==b[0])
        {
            m[0][i]=1;
        }
        else
            m[0][i]=m[0][i-1];
    }
    for(i=1;i<M;i++)
    {
        if(b[i]==a[0])
        {
            m[i][0]=1;
        }
        else
            m[i][0]=m[i-1][0];
    }
    for(i=1;i<N;i++)
    {
        for(j=1;j<M;j++)
        {
            if(a[i]==b[j])
                m[i][j]=m[i-1][j-1]+1;
            else
                m[i][j]=max(m[i-1][j],m[i][j-1]);
        }
    }
    fout << m[N-1][M-1];

    return 0;
}





/// a b c e f e l o
/// e n g a b l x o

/// a b c e
/// a b x b