#include<bits/stdc++.h>
using namespace std;

int dp[1000 + 5][1000 + 5];

int main(){

    string a, b;
    while(cin >> a >> b){

       int lena = a.size();
       int lenb = b.size();

       for(int i = 1; i <= lena; i ++){
            for(int j = 1; j <= lenb; j ++){
                if(a[i-1] == b[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
                else dp[i][j] = max(dp[i][j-1], dp[i-1][j]);
            }
       }

       cout << dp[lena][lenb] << endl;

    }

	return 0;
}