#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int M = 4010;
vector<int> solve(string& L,string& R){
	vector<int> res(M,1);
	for(int i = 0; i < L.size(); ++i){
		int flg = 1;
		for(int j = 0; j < R.size(); ++j){
			if(i+j<L.size()) {
				if(L[i+j]==R[j] || L[i+j]=='?' || R[j]=='?');
				else {
					flg = 0;
					break;
				}
			}
		}
		res[i] = flg;
	}
	return res;
}

int main() {
	vector<string> S(3); cin >> S[0] >> S[1] >> S[2];
	vector<vector<vector<int>>> A(3,vector<vector<int>>(3));
	int ans = 8000;
	for(int i = 0; i < 3; ++i){
		for(int j = 0; j < 3; ++j) {
			for(int k = 0; k < 3; ++k){
				if(i==j || j==k || k==i) continue;
				A[i][j] = solve(S[i],S[j]);
			}			
		}
	}
	for(int i = 0; i < 3; ++i){
		for(int j = 0; j < 3; ++j) {
			for(int k = 0; k < 3; ++k){
				if(i==j || j==k || k==i) continue;
				for(int l = 0; l < M; ++l){
					for(int r = 0; r < M; ++r){
						if(!A[i][j][l]) continue;
						if(!A[j][k][r]) continue;
						if(l+r>=M) continue; 
						if(!A[i][k][l+r]) continue;
						int cnt = max({S[i].size(),l+S[j].size(),l+r+S[k].size()});
						chmin(ans,cnt);
					}
				}				
			}			
		}
	}
	cout << ans << endl;
    return 0;
}


Measured memory_bytes: 384