import java.util.Scanner;
import java.lang.String;
import java.lang.Math;

/*
class TreeNode
{
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; left = null; right = null;}
}
class ListNode
{
    int val;
    ListNode next;
    ListNode(int x){val = x; next = null;}
}
*/
public class Solution {


    public static void main(String[] args)
    {
        //int T;
        Scanner jin = new Scanner(System.in);
        //T = jin.nextInt();
        String str1 = jin.next();
        String str2 = jin.next();
        int len = str1.length();
        int[][] array = new int[len+1][len+1];
        for(int i = 0; i < len+1; i++)
            array[0][i] = array[i][0] = 0;
        for(int i = 0; i < len; i++)
        {
            for(int j = 0; j < len; j++)
            {
                if (str1.charAt(i) == str2.charAt(j)) {
                    array[i+1][j+1] = array[i][j] + 1;
                }
                else {
                    array[i+1][j+1] = Math.max(array[i][j+1], array[i+1][j]);
                }
            }
        }
        System.out.println(array[len][len]);
        array = null;
    }

}