#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
string a, b, c;
int dp[105][105][105];


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> a >> b >> c;

	for (int i = 1; i <= a.length(); i++) {
		for (int j = 1; j <= b.length(); j++) {
			for (int k = 1; k <= c.length(); k++) {
				
				if (a[i-1] == b[j-1] && b[j-1] == c[k-1]) {
					dp[i][j][k] = dp[i-1][j-1][k-1] + 1;
				}

				dp[i][j][k] = max({
					dp[i][j][k],
					dp[i-1][j][k],
					dp[i][j-1][k],
					dp[i][j][k-1]
				});
				
			}
		}
	}

	cout << dp[a.length()][b.length()][c.length()];
	return 0;
}