#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); }
template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

struct shifter{
    ll n, min_v;
    shifter(ll _min_v, ll _max_v): min_v(_min_v){
        n = _max_v - min_v;
    }
    ll operator()(ll x) { return x - min_v; }
    ll unshift(ll sx) { return sx + min_v; }
};
// auto sh = shifter(-10000, 10000);

int solve() {
    string a,b,c;cin>>a>>b>>c;
    ll na = sz(a), nb = sz(b), nc = sz(c);

    auto sh = shifter(-10000, 10000);
    vec<bool> bc(sh.n, true);
    rep(i, nb)rep(j, nc){
        if (b[i] != '?' && c[j] != '?' && b[i] != c[j]) bc[sh(i-j)] = false;
    }

    vec<bool> ba(sh.n, true);
    rep(i, nb)rep(j, na){
        if (b[i] != '?' && a[j] != '?' && b[i] != a[j]) ba[sh(i-j)] = false;
    }

    vec<bool> ac(sh.n, true);
    rep(i, na)rep(j, nc){
        if (a[i] != '?' && c[j] != '?' && a[i] != c[j]) ac[sh(i-j)] = false;
    }

    ll res = na + nb + nc;
    ll sb = 0;
    rep(sa, -4001, 4001){
        rep(sc, -4001, 4001){
            if (ba[sh(sa)] && bc[sh(sc)] && ac[sh(sc-sa)]){
                chmin(res, max({sa+na-1, sb+nb-1, sc+nc-1}) - min({sa, sb, sc}) + 1);
            }
        }
    }
    cout << res << endl;

    return 0; 
}


int main(){/*{{{*/
    solve();
    check_input();
    return 0;
}/*}}}*/


Measured memory_bytes: 256