#define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head>
void dump_1(const char* str, Head&& h)
{
    cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char* str, Head&& h, Tail&&... t)
{
    while (*str != ',') {
        cerr << *str++;
    }
    cerr << ": " << h << ' ';
    dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char* str, const T v[], const ll size)
{
    while (*str != ',') {
        cerr << *str++;
    }
    cerr << ": ";
    for1 (i, size) {
        if (i != 0) {
            cerr << ' ';
        }
        cerr << v[i];
    }
    cerr << '\n';
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v)
{
    os << v.first << ' ' << v.second;
    return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v)
{
    os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v)
{
    os << '{';
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ", ";
        }
        os << it->first << ':' << it->second;
    }
    os << '}';
    return os;
}
ll divup(ll nume, ll deno)
{
    assert(nume >= 0);
    assert(deno > 0);
    return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T& a, const T& b)
{
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T>
void vin(vector<T>& v, ll len)
{
    for1 (i, len) {
        cin >> v[i];
    }
}
template <typename Head>
void in_1(Head& h)
{
    cin >> h;
}
template <typename Head, typename... Tail>
void in_1(Head& h, Tail&... t)
{
    cin >> h;
    in_1(t...);
}
template <typename Head>
void print_1(Head&& h)
{
    cout << h << '\n';
}
template <typename Head, typename... Tail>
void print_1(Head&& h, Tail&&... t)
{
    cout << h << ' ';
    print_1(t...);
}
//---------------------------------------------------------
bool match(const string& A, ll la, ll ai, const string& B, ll lb, ll bi)
{
    ll ra = la - ai;
    ll rb = lb - bi;
    ll rm = min(ra, rb);
    for1 (i, rm) {
        char a = A[ai + i];
        char b = B[bi + i];
        if (a == '?' || b == '?' || a == b) {
            // ok
        }
        else {
            return false;
        }
    }
    return true;
}
vector<bool> ab(16005, true);
vector<bool> bc(16005, true);
vector<bool> ac(16005, true);
ll la, lb, lc;
ll calc1(const string& A, const string& B, const string& C)
{
    ll ans = INF;
    const ll a = 0;
    for2 (b, -4000, 4001) {
        for2 (c, -4000, 4001) {
            if (ab[b - a + 8000] && bc[c - b + 8000] && ac[c - a + 8000]) {
                ll l = min({a, b, c});
                ll r = max({a + la, b + lb, c + lc});
                chmin(ans, r - l);
            }
        }
    }
    return ans;
}

void solve()
{
    string A, B, C;
    in(A, B, C);
    // string A(2000, '?');
    // string B(1000, 'a');
    // string C(1000, 'b');
    la = A.size();
    lb = B.size();
    lc = C.size();
    for2 (i, -8000, 8001) {
        if (i < 0) {
            ab[i + 8000] = match(A, la, 0, B, lb, -i);
        }
        else {
            ab[i + 8000] = match(A, la, i, B, lb, 0);
        }
    }
    for2 (i, -8000, 8001) {
        if (i < 0) {
            bc[i + 8000] = match(B, lb, 0, C, lc, -i);
        }
        else {
            bc[i + 8000] = match(B, lb, i, C, lc, 0);
        }
    }
    for2 (i, -8000, 8001) {
        if (i < 0) {
            ac[i + 8000] = match(A, la, 0, C, lc, -i);
        }
        else {
            ac[i + 8000] = match(A, la, i, C, lc, 0);
        }
    }

    ll ans = INF;
    chmin(ans, calc1(A, B, C));
    /*
    chmin(ans, calc1(A, C, B));
    chmin(ans, calc1(B, A, C));
    chmin(ans, calc1(B, C, A));
    chmin(ans, calc1(C, A, B));
    chmin(ans, calc1(C, B, A));
    */
    print(ans);
}
//---------------------------------------------------------
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(16);
    cerr << fixed << setprecision(16);
    solve();
}


Measured memory_bytes: 256