#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
    ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(i, h) {                                                            \
            rep(j, w) cerr << a[i][j] << sp;                                   \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(i, n) if (i) cerr << sp << a[i];                                   \
        else cerr << a[i];                                                     \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

signed main() {
    string S, T, U;
    cin >> S >> T >> U;
    ll a = S.size(), b = T.size(), c = U.size();
#define comp(S, T, A)                                                          \
    {                                                                          \
        rep(i, S.size()) {                                                     \
            rep(j, T.size()) {                                                 \
                if (S[i + j] != T[j] and S[i + j] != '?' and T[j] != '?')      \
                    break;                                                     \
                if (i + j == (ll) S.size() - 1 or j == (ll) T.size() - 1) {    \
                    A[i] = 1;                                                  \
                    break;                                                     \
                }                                                              \
            }                                                                  \
        }                                                                      \
    }
    vector<bool> st(a + 1), tu(b + 1), us(c + 1);
    vector<bool> ts(b + 1), ut(c + 1), su(a + 1);
    comp(S, T, st) comp(T, U, tu) comp(U, S, us);
    comp(T, S, ts) comp(U, T, ut) comp(S, U, su);
    st[a] = tu[b] = us[c] = ts[b] = ut[c] = su[a] = 1;
    ll res = INF;
#define conv(a, b, c, st, tu, su)                                              \
    {                                                                          \
        rep(i, a + 1) rep(j, b + 1) {                                          \
            if (not st[i]) continue;                                           \
            if (not tu[j]) continue;                                           \
            if (a > i + j and not su[i + j]) continue;                         \
            chmin(res, max({a, i + b, i + j + c}));                            \
        }                                                                      \
    }
#define conv2(a, b, c, st, su, tu)                                             \
    {                                                                          \
        rep(i, a + 1) rep(j, a + 1) {                                          \
            if (i > j) continue;                                               \
            if (not st[i]) continue;                                           \
            if (not su[j]) continue;                                           \
            if (b > j - i and not tu[j - i]) continue;                         \
            chmin(res, max({a, i + b, j + c}));                                \
        }                                                                      \
    }
    conv(a, b, c, st, tu, su);
    conv(b, c, a, tu, us, ts);
    conv(c, a, b, us, st, ut);
    conv(b, a, c, ts, su, tu);
    conv(a, c, b, su, ut, st);
    conv(c, b, a, ut, ts, us);
    conv2(a, c, b, su, st, ut);
    conv2(a, b, c, st, su, tu);
    conv2(b, a, c, ts, tu, su);
    conv2(b, c, a, tu, ts, us);
    conv2(c, b, a, ut, us, ts);
    conv2(c, a, b, us, ut, st);
    cout << res << endl;
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined


Measured memory_bytes: 384