#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		dbool(const dbool& b) : boolvalue(b.boolvalue) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<std::dvector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

// Cooley–Tukey FFT algorithm
vector<complex<double>> fft(vector<complex<double>> a, bool inverse = false) {
	int n = a.size();
	int h = 0; // h = log_2(n)
	for (int i = 0; 1 << i < n; i++) h++;
	// バタフライ演算用の配置入れ替え
	for (int i = 0; i < n; i++) {
		int j = 0;
		for (int k = 0; k < h; k++) j |= (i >> k & 1) << (h - 1 - k);
		if (i < j) swap(a[i], a[j]);
	}
	// バタフライ演算
	for (int b = 1; b < n; b *= 2) {
		// 第 log_2(b) + 1 段
		// ブロックサイズ = b * 2
		for (int j = 0; j < b; j++) {
			// ブロック内 j 個目
			// 重み w = (1 の原始 2b 乗根の j 乗)
			complex<double> w =
				polar(1.0, (M_PI * 2) / (2 * b) * j * (inverse ? 1 : -1));
			for (int k = 0; k < n; k += b * 2) {
				// k を先頭とするブロック
				complex<double> s = a[j + k];		 // 前
				complex<double> t = a[j + k + b] * w; // 後
				a[j + k] = s + t;					 // 前の更新
				a[j + k + b] = s - t;				 // 後の更新
			}
		}
	}
	// 逆変換時にサイズで割る調整
	if (inverse)
		for (int i = 0; i < n; i++) a[i] /= n;
	return a;
}

vector<complex<double>> fft(vector<double> a, bool inverse = false) {
	vector<complex<double>> a_complex(a.size());
	for(int i=0; i<(ll)a.size(); i++) a_complex[i] = complex<double>(a[i], 0);
	return fft(a_complex, inverse);
}

// FFT による畳み込み O(N log N)
template<typename T> 
vector<complex<double>> convolve(vector<T> a, vector<T> b) {
	int s = a.size() + b.size() - 1; // 畳み込み結果のサイズ
	int t = 1; // FFT に使う配列のサイズ（2 の累乗）
	while (t < s) t *= 2;
	a.resize(t); // FFT するためにリサイズ
	b.resize(t); // FFT するためにリサイズ
	vector<complex<double>> A = fft(a);
	vector<complex<double>> B = fft(b);
	for (int i = 0; i < t; i++) {
		A[i] *= B[i]; // 畳み込み結果の FFT 結果を得る
	}
	A = fft(A, true); // IFFT で畳み込み結果を得る
	A.resize(s);
	return A;
}

//https://www.creativ.xyz/fast-fourier-transform/
//https://cp-algorithms.com/algebra/fft.html#toc-tgt-12
//text内からkeyに一致する箇所を全て見つけます
//1文字ワイルドカード'?'を使用可能
//arg:
//	text: 検索対象の文字列
//	key: キーワードの文字列
//	partialmatch: true=textからはみ出した範囲も含めて検索, false=keyがtextに完全に含まれる範囲で検索
//	firstchar: 英大文字の場合は'A'を指定してください
//return:
//	keyに一致するtext内のindex全て
//計算量: N=|text|+|key| として O(NlogN)
vector<ll> findkeyword(string text, string key, bool partialmatch=false, char firstchar='a'){
	ll textsize=text.size(), keysize=key.size();
	vector<complex<double>> x(text.size(), {0,0}), y(key.size(), {0,0});
	vector<complex<double>> wildx(text.size(), {0,0}), wildy(key.size(), {0,0});
	for(ll i=0; i<textsize; i++){
		if(text[i]=='?')continue;
		double a=2.*M_PI*(text[i]-firstchar)/26.;
		x[i]={cos(a),sin(a)};
		wildx[i]={1,0};
	}
	for(ll i=0; i<keysize; i++){
		if(key[i]=='?')continue;
		double a=2.*M_PI*(key[i]-firstchar)/26.;
		y[keysize-1-i]={cos(a),-sin(a)};
		wildy[keysize-1-i]={1,0};
	}
	vector<complex<double>> c=convolve(x,y);
	vector<complex<double>> wildc=convolve(wildx,wildy);

	vector<ll> ans;
	ll beginval,endval;
	if(partialmatch)beginval=0, endval=c.size();
	else beginval=keysize-1, endval=textsize;
	for(ll i=beginval; i<endval; i++){
		if(abs(c[i].real()-wildc[i].real())<EPS && abs(c[i].imag())<EPS)ans.push_back(-keysize+1+i);
	}
	return ans;
}

/*-----8<-----library-----8<-----*/

void solve() {
	vector<string> a(3,"");
	rep(i,3)cin>>a[i];
	
	vector<vector<ll>> matched(3);
	matched[0]=findkeyword(a[0],a[1],true);
	matched[1]=findkeyword(a[1],a[2],true);
	matched[2]=findkeyword(a[2],a[0],true);
	matched[0].insert(matched[0].begin(),-a[1].size());
	matched[1].insert(matched[1].begin(),-a[2].size());
	matched[2].insert(matched[2].begin(),-a[0].size());
	matched[0].push_back(a[0].size());
	matched[1].push_back(a[1].size());
	matched[2].push_back(a[2].size());

	debug(matched);
	
	ll ans=INF;
	rep(i,3){
		for(ll x:matched[(0+i)%3]) for(ll y:matched[(1+i)%3]){
			ll z=-x-y;
			auto it=lower_bound(all(matched[(2+i)%3]),z);
			if(z<matched[(2+i)%3].front() || matched[(2+i)%3].back()<z || *it==z){
				ll begin=min({0LL, x, x+y});
				ll end=max({(ll)a[(0+i)%3].size(), (ll)a[(1+i)%3].size()+x, (ll)a[(2+i)%3].size()+x+y});
				debug(i,x,y,z,begin,end);
				if(chmin(ans,end-begin)){
					debug(ans);
				}
			}
		}
	}
	p(ans);
}

// https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_e
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 896