// Solution of LCS 
 
#include <bits/stdc++.h>
using namespace std;
 
int LCS(string A,string B,int i,int j)
{
 if(i>= A.length() || j>=B.length())
 {
      return 0;
 }
 else if(A[i]==B[j])
 {
      return 1+LCS(A, B, i+1, j+1);
 }
 else
 {
     return max(LCS(A, B, i+1, j), LCS(A, B, i, j+1));
 }
}
int main() {
     string A,B;
	 while(getline(cin,A)){
 
    getline(cin,B);
    int length = LCS(A, B, 0, 0);
    cout<<length<<endl;
    }
    return 0;
}

Ly8gU29sdXRpb24gb2YgTENTIAoKI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgTENTKHN0cmluZyBBLHN0cmluZyBCLGludCBpLGludCBqKQp7CiBpZihpPj0gQS5sZW5ndGgoKSB8fCBqPj1CLmxlbmd0aCgpKQogewogICAgICByZXR1cm4gMDsKIH0KIGVsc2UgaWYoQVtpXT09QltqXSkKIHsKICAgICAgcmV0dXJuIDErTENTKEEsIEIsIGkrMSwgaisxKTsKIH0KIGVsc2UKIHsKICAgICByZXR1cm4gbWF4KExDUyhBLCBCLCBpKzEsIGopLCBMQ1MoQSwgQiwgaSwgaisxKSk7CiB9Cn0KaW50IG1haW4oKSB7CiAgICAgc3RyaW5nIEEsQjsKCSB3aGlsZShnZXRsaW5lKGNpbixBKSl7CgkgCSAKICAgIGdldGxpbmUoY2luLEIpOwogICAgaW50IGxlbmd0aCA9IExDUyhBLCBCLCAwLCAwKTsKICAgIGNvdXQ8PGxlbmd0aDw8ZW5kbDsKICAgIH0KICAgIHJldHVybiAwOwp9