#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd_calc(T a, T b){ if(b){ return gcd_calc(b, a % b); }else{ return a; }}
template<class T> T gcd(T a, T b){ if(a < b) swap(a, b); return gcd_calc(a, b); }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
inline int at(int x, int k){ return (x >> k) & 1; }
random_device rnd;

int main(){
    string a[3];
    cins(a, a + 3);
    bool is_zure_ok[3][8040]; // 0-1, 1-2, 2-0
    for(int i = 0; i < 3; i++){
        string str1 = a[i], str2 = a[(i + 1) % 3];
        for(int j = 0; j < 8040; j++){
            int zure = j - 4020;
            bool ans = true;
            for(int k = max(0, -zure); k < min(int(str2.size()), int(str1.size()) - zure); k++){
                if(str1[k + zure] != str2[k] && str1[k + zure] != '?' && str2[k] != '?'){
                    ans = false;
                    break;
                }
            }
            is_zure_ok[i][j] = ans;
        }
    }
    int ans = 1e9;
    for(int c = 0; c < 3; c++){
        int no1 = c, no2 = (c + 1) % 3, no3 = (c + 2) % 3;
        for(int i = 0; i < 4020; i++){
            for(int j = 0; j < 4020; j++){
                if(is_zure_ok[no1][i + 4020] && is_zure_ok[no3][-j + 4020] && is_zure_ok[no2][j - i + 4020]){
                    ans = min(ans, max({int(a[no1].size()), int(a[no2].size()) + i, int(a[no3].size()) + j}));
                    /*if(max({int(a[no1].size()), int(a[no2].size()) + i, int(a[no3].size()) + j}) == 6){
                        cout << c << " " << i << " " << j << endl;
                        cout << max({int(a[no1].size()), int(a[no2].size()) + i, int(a[no3].size()) + j}) << endl;
                        return 0;
                    }*/
                }
            }
        }
    }
    cout << ans << endl;
}


Measured memory_bytes: 256