#include <iostream>
#include <cstring>
using namespace std;
int max(int a, int b) {
return (a > b) ? a : b;
}
int longestCommonSubsequence(const string& text1, const string& text2) {
int m = text1.length();
int n = text2.length();
int dp[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
} else if (text1[i - 1] == text2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
return dp[m][n];
}
int main() {
string input;
getline(cin, input);
size_t commaIndex = input.find(',');
string text1 = input.substr(0, commaIndex);
string text2 = input.substr(commaIndex + 1);
int ans = longestCommonSubsequence(text1, text2);
cout << ans << endl;
return 0;
}