// #pragma GCC optimize("O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

template <class T1, class T2>
ostream& operator << (ostream& out, pair <T1, T2> p)
{
	out << '(' << p.first << ',' << p.second << ')';
	return out;
}

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
	in >> p.first >> p.second;
	return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
	for (T &x : v)
		in >> x;
	return in;
}

template <class T>
ostream& operator << (ostream& out, vector<vector<T>> &v)
{
	for (vector<T> &x : v)
		out << x << '\n';
	return out;
}

template <class T>
ostream& operator << (ostream& out, vector<T> &v)
{
	for (T &x : v)
		out << x << ' ';
	return out;
}

long long gcd (long long a, long long b)
{
	if (b > a)
		swap(a, b);
	return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = a; i < b; i++)
#define per(i,b,a) for (int i = b; i > a; i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 1000000007;

vvi match(string a, string b)
{
	vvi dp(a.size()+1, vi(b.size()+1, true));
	rep(i,0,a.size())
		rep(j,0,b.size())
			dp[i+1][j+1] = (a[i] == b[j] or a[i] == '?' or b[j] == '?') and dp[i][j];
	// cerr<<dp<<'\n';
	return dp;
}

int f(string a, string b, string c)
{
	cerr << a << ' ' << b << ' ' << c << '\n';
	int ans = b.size() + a.size() + c.size();
	auto dp_ab = match(a, b);
	reverse(all(b));
	reverse(all(c));
	auto dp_cb = match(c, b);
	reverse(all(b));
	reverse(all(c));
	auto dp_ac = match(a, c);
	rep(i,0,b.size())
	{
		if(dp_ab[a.size()][i+1])
			ans = min(ans, int(b.size() + c.size() + a.size() - min(i+1, int(a.size()))));
		if(dp_cb[c.size()][i+1])
			ans = min(ans, int(b.size() + a.size() + c.size() - min(i+1, int(c.size()))));
	}
	// cerr<<dp_ac;
	rep(i,0,b.size())
		rep(j,0,b.size())
		{
			if(
				dp_ab[a.size()][i+1] and
				dp_cb[c.size()][b.size()-j] and
				(i >= j and j + int(c.size()) - 1 >= i - int(a.size()) + 1 ? dp_ac[a.size()][i-j+1] : true)
			)
					ans = min(ans, int(b.size() + a.size() - min(int(a.size()), i+1) + c.size() - min(int(c.size()), int(b.size() - j))));
		}
	cerr << ans << '\n';
	return ans;
}

signed main()
{
	ios::sync_with_stdio(false);
	#ifdef ONLINE_JUDGE
	cin.tie(nullptr);
	cout.tie(nullptr);
	cerr.setstate(ios::failbit);
	#endif

	int ans = 6000;
	// string a = string(2000, 'a'),b = string(2000, '?'),c = string(2000, 'c');
	string a, b, c;
	cin >> a >> b >> c;
	ans = min(ans, f(a, b, c));
	ans = min(ans, f(c, b, a));
	ans = min(ans, f(b, a, c));
	ans = min(ans, f(c, a, b));
	ans = min(ans, f(a, c, b));
	ans = min(ans, f(b, c, a));
	cout << ans;
}


Measured memory_bytes: 47444