#include
#include
using namespace std;
int longestcommonsubsequence(int i,string s1,int j,string s2){
int row=s1.length()+1;
int col=s2.length()+1;
vector<vector >dp(row,(vector(col)));
for(int i=0;i<col;i++){
dp[s1.length()][i]=0;
}
for(int i=0;i<row;i++){
dp[i][s2.length()]=0;
}
for(int i=s1.length()-1;i>=0;iā){
for(int j=s2.length();j>=0;jā){
int result;
if(s1[i]==s2[j]){
result=1+dp[i+1][j+1];
}
else{
// dp[i][j]=max(dp[i+1][j],dp[i][j+1]);
int first=dp[i+1][j];
int second=dp[i][j+1];
int result = max(first,second);
}
dp[i][j]=result;
}
}
return dp[0][0];
}
int main() {
string s1;
getline(cin,s1);
string s2;
getline(cin,s2);
cout<<longestcommonsubsequence(0,s1,0,s2)<<endl;
return 0;
}