#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

ll solve(vector<string> s) {
	ll ans = INF;
	vii match(2);
	rep (i, 2) {
		match[i].resize(s[i].size());
		int cnt = 0;
		rep (st, s[i].size()) {
			bool flag = true;
			for (int j = 0; j < s[2].size(); j++) {
				if (st + j >= s[i].size()) break;
				if (s[i][st + j] != '?' and s[2][j] != '?' and s[i][st + j] != s[2][j]) {
					flag = false;
					break;
				}
			}
			match[i][st] = flag;
		}
	}

	for (int i = 0; i <= 4000; i++) {
		string s1 = s[0], s2 = s[1];
		string t = s1;
		bool flag = true;
		rep (j, s2.size()) {
			while (i + j >= t.size()) t += '?';
			if (t[i + j] != '?') {
				if (s2[j] != '?' and t[i + j] != s2[j]) {
					flag = false;
					break;
				}
			}
			else {
				if (s2[j] != '?') t[i + j] = s2[j];
			}
		}
		if (not flag) continue;
		chmin(ans, (ll)t.size() + (ll)s[2].size());
		for (int j = i; j < t.size(); j++) {
			if (j < s[0].size()) {
				if (not match[0][j]) continue;
			}
			if (j - i < s[1].size()) {
				if (not match[1][j - i]) continue;
			}
			chmin(ans, max((ll)t.size(), (ll)j + (ll)s[2].size()));
		}
	}
	return ans;
}

ll solve_all(vector<string> s) {
	vi perm(3);
	rep (i, 3) perm[i] = i;

	ll ans = INF;
	do {
		vector<string> t(3);
		rep (i, 3) {
			t[i] = s[perm[i]];
		}
		chmin(ans, solve(t));
	} while (next_permutation(all(perm)));
	return ans;
}
 
signed main() {
	vector<string> s(3);
	rep (i, 3) cin >> s[i];

	ll ans1 = solve_all(s);
	cout << ans1 << endl;
}

Measured memory_bytes: 384