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

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int dp[2][1005];

int main() {
    string s, t;
    fin >> s >> t;

    int n = s.size();
    int m = t.size();

    for (int i = 1; i <= n; i++) {
        int cur = i % 2;
        int last = 1 - cur;

        for (int j = 1; j <= m; j++) {
            if (s[i-1] == t[j-1]) {
                dp[cur][j] = dp[last][j-1] + 1;
            } else {
                dp[cur][j] = max(dp[last][j], dp[cur][j-1]);
            }
        }
    }

    fout << dp[n % 2][m] << '\n';
}