#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
//#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline void sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline void BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

auto fit(const string& a, const string& b, ll r) {
	string ans = a.substr(0, r);
	ll as = a.size();
	ll bs = b.size();
	ll mn = std::min(as - r, bs);
	REP(i, mn) {
		if (a[i + r] != '?' && b[i] != '?' && a[i + r] != b[i]) { return string{"*"}; }

		if (a[i + r] == '?') {
			ans += b[i];
		} else {
			ans += a[i + r];
		}
	}
	if (as > bs + r) {
		ans += a.substr(mn + r, as - mn);
	} else {
		ans += b.substr(mn, bs - mn);
	}
	return ans;
}

auto solve_on(const string& a, const string& b, const string& c) {
	ll as = a.size();
	ll bs = b.size();
	ll cs = c.size();

	V<bool> ab(as);
	REP(i, as) { auto s = fit(a, b, i);	ab[i] = (s == "*") ? false : true; }
	V<bool> bc(bs);
	REP(i, bs) { auto s = fit(b, c, i);	bc[i] = (s == "*") ? false : true; }
	V<bool> ac(as);
	REP(i, as) { auto s = fit(a, c, i);	ac[i] = (s == "*") ? false : true; }

	ll ans = as + bs + cs;
	REP(i, as) if (ab[i]) {
		REP(j, bs)if (bc[j]) {
			if (i + j >= as || ac[i + j]) {
				ll p = std::max(as, i + bs);
				chmax(p, i + j + cs);
				chmin(ans, p);
			}
		}
		FOR(j, bs, as) {
			if (i + j >= as || ac[i + j]) {
				ll p = std::max(as, i + bs);
				chmax(p, i + j + cs);
				chmin(ans, p);
			}
		}
	}
	return ans;
}
auto solve(const string& a, const string& b, const string& c) {

	auto ans = 1e10;
	chmin(ans, solve_on(a, b, c));
	chmin(ans, solve_on(a, c, b));
	chmin(ans, solve_on(b, a, c));
	chmin(ans, solve_on(b, c, a));
	chmin(ans, solve_on(c, a, b));
	chmin(ans, solve_on(c, b, a));
	return ans;
}

auto solve_c_on(const string& a, const string& b, const string& c) {
	ll as = a.size();
	ll bs = b.size();
	ll cs = c.size();

	ll ans = as + bs + cs;
	REP(r, as) {
		auto s = fit(a, b, r);
		if (s == "*") { continue; }
		REP(r2, s.size()) {
			auto s2 = fit(s, c, r2);
			if (s2 == "*") { continue; }
			chmin(ans, s2.size());

		}
	}
	return ans;
}
auto solve_c(const string& a, const string& b, const string& c) {

	auto ans = 1e10;
	chmin(ans, solve_c_on(a, b, c));
	chmin(ans, solve_c_on(a, c, b));
	chmin(ans, solve_c_on(b, a, c));
	chmin(ans, solve_c_on(b, c, a));
	chmin(ans, solve_c_on(c, a, b));
	chmin(ans, solve_c_on(c, b, a));
	return ans;
}

signed main() {
	/**/
	string a, b, c;
	cin >> a >> b >> c;
	auto p = fit(a, b, 1);
	auto ans = solve(a, b, c);
	cout << ans << endl;

	//auto ans_c = solve_c(a, b, c);
	//dump(ans_c);
	/*/
	auto gen = Sample::SampleGenerator();
	REP(_, 100) {
		auto [as, bs, cs] = gen.generate(PAIR{3,5}, PAIR{3,5}, PAIR{3,5});
		auto [p, q, r] = gen.generate(
			V<PAIR>(as, {'a','d'}),
			V<PAIR>(bs, {'a','d'}),
			V<PAIR>(cs, {'a','d'})
		);
		string a, b, c;
		REPC(t, p) { a += (t == 'd') ? '?' : t; }
		REPC(t, q) { b += (t == 'd') ? '?' : t; }
		REPC(t, r) { c += (t == 'd') ? '?' : t; }
		auto ans = solve(a, b, c);
		auto ans_c = solve_c(a, b, c);
		if (ans != ans_c) {
			cout << a << endl << b << endl << c << endl;
			dump(ans, ans_c);
			return 0;
		}
	}
	/**/
}


Measured memory_bytes: 256