#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

const std::size_t SIZE = 2010;
using bs_t = std::bitset<SIZE * 2>;

ll solve() {
    std::string s[3];
    for (auto &&e : s) std::cin >> e;

    bs_t dp[3][3];
    for (ll i = 0; i < 3; i++) for (ll j = 0; j < 3; j++) if (i != j) {
        for (ll k = 0; k < 2 * SIZE; k++) {
            bool ok = true;
            for (ll si = k, sj = 0; si < s[i].size() && sj < s[j].size(); si++, sj++) {
                if (s[i][si] == '?' || s[j][sj] == '?') continue;
                if (s[i][si] != s[j][sj]) {
                    ok = false;
                    break;
                }
            }
            if (!ok) dp[i][j].set(k, 1);
        }
    }

    ll len = s[0].size() + s[1].size() + s[2].size();
    ll ls[] = { s[0].size(), s[1].size(), s[2].size() };
    for (ll i = 0; i < 3; i++) for (ll j = 0; j < 3; j++) if (i != j) {
        ll k = 3 - (i + j);
        for (ll l = 0; l < 2 * SIZE; l++) {
            if (dp[i][j].test(l)) continue;
            auto bs = (~dp[j][k]) & (~(dp[i][k] >> l));
            ll idx = bs._Find_first();
            if (idx == bs.size()) continue;
            ll maxv = var_max(l + idx + ls[k], l + ls[j], ls[i]);
            chmin(len, maxv);
        }
    }

    return len;
}

int main() {
    std::cout << solve() << '\n';
    return 0;
}


Measured memory_bytes: 256