#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

vector<int> KMP(string S) {
	int n = (int)S.size();
	S += '_';
	vector<int> A(n + 1);
	A[0] = -1;
	int j = -1;
	rep(i, 0, n) {
		while (j >= 0 && S[i] != S[j]) j = A[j];
		j++;
		if(S[i + 1] == S[j]) A[i + 1] = A[j];
		else A[i + 1] = j;
	}
	return A;
}

string S[3];
int D[3][3][MAX_N];

void solve() {
	rep(i, 0, 3) cin >> S[i];
	
	// int res = sz(S[0]) + sz(S[1]) + sz(S[2]);
	int res = inf;
	auto sc = [](char a, char b) {
		return a == '?' || b == '?' || a == b;
	};
	rep(a, 0, 3) {
		rep(b, 0, 3) {
			if(a == b) continue;
			rep(i, 0, sz(S[a]) + 1) {
				bool ok = true;
				rep(j, 0, sz(S[b])) {
					if(i + j >= sz(S[a])) break;
					if(!sc(S[a][i + j], S[b][j])) {
						ok = false;
						break;
					}
				}
				D[a][b][i] = ok;
			}
			// debug(a, b, vi(D[a][b], D[a][b] + sz(S[a]) + 1));
		}
	}

	vi vec;
	rep(i, 0, 3) vec.pb(i);

	do {
		int a = vec[0], b = vec[1], c = vec[2];
		int n = sz(S[a]), m = sz(S[b]), l = sz(S[c]);
		rep(i, 0, n + 1) {
			if(!D[a][b][i]) continue;
			rep(j, 0, max(n - i, m) + 1) {
				int tmp = max(max(n, m + i), l + i + j);
				if(D[a][c][min(i + j, n)] && D[b][c][min(j, m)]) {
					MIN(res, tmp);
					// debug(vec, i, j, tmp);
				}
			}
		}
	} while(next_permutation(all(vec)));
	cout << res << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 10752