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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


inline bool eq(char c, char d){
    if (c == d) return true;
    if (c=='?') return true;
    if (d=='?') return true;
    return false;
}


inline char eqc(char c, char d){
    if (c == d) return c;
    if (c=='?') return d;
    if (d=='?') return c;
    return '#';
}


#define MLEN 4000


int sub(string& a,string& b,string& c){
    int ans = INT_MAX;
    int aL = a.size(), bL = b.size(), cL = c.size();

    vector<bool> ab(MLEN*2+1,true), bc(MLEN*2+1,true), ca(MLEN*2+1,true);
    rep(i,aL) rep(j,bL) if (!eq(a[i], b[j])) ab[MLEN+i-j] = false;
    rep(i,bL) rep(j,cL) if (!eq(b[i], c[j])) bc[MLEN+i-j] = false;
    rep(i,cL) rep(j,aL) if (!eq(c[i], a[j])) ca[MLEN+i-j] = false;

    auto possible = [&](int bOfs, int cOfs) -> bool {
        return ab[MLEN+bOfs] && bc[MLEN+cOfs-bOfs] && ca[MLEN-cOfs];
    };

    for(int bOfs=0; bOfs<=aL; ++bOfs){
        int abL = max(aL, bOfs+bL);
        for(int cOfs=bOfs; cOfs<=abL; ++cOfs){
            if (possible(bOfs, cOfs)) {
                int L = max(abL, cOfs+cL);
                amin(ans, L);
            }
        }
    }
    return ans;
}

int solve(vector<string>& a){
    int ans = INT_MAX;
    vi iot {0,1,2};
    do{
        amin(ans, sub(a[iot[0]], a[iot[1]], a[iot[2]]));
    } while(next_permutation(ALL(iot)));
    return ans;
}

int main() {
    vector<string> a(3); cin >> a[0] >> a[1] >> a[2];
    cout << solve(a) << endl;
    return 0;
}


Measured memory_bytes: 256