#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
// ll mod = 998244353;
ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 /*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
bool multicase = false;

ll n,m,num,sum,a,b,c,d,e,h,q;
ll w, ans;
ll k;
bool ng[5][5][10000];;
string s[5];

ll calc(ll p1, ll p2){
    ll res = INF;
    for(ll i=0;i<3;i++){
        for(ll j=0;j<3;j++){
            if(ng[i][j][p1])continue;
            if(i == j)continue;
            for(ll k=0;k<3;k++){
                if(i == k || j == k)continue;
                if(!ng[j][k][p2-p1] && !ng[i][k][p2]){
                    res = min(res, max({(ll)s[i].size(), (ll)s[j].size() + p1, (ll)s[k].size() + p2}));
                }
            }
        }
    }
    return res;
}

void solve(){
    n = 2000;
    for(ll i=0;i<3;i++){
        cin >> s[i];
    }
    for(ll s1=0;s1<3;s1++){
        for(ll s2=0;s2<3;s2++){
            if(s1 == s2)continue;
            for(ll p=0;p<n;p++){
                for(ll i=0;i<3*n;i++){
                    if(i < s[s1].size() &&
                        i - p >= 0 && 
                        i - p < s[s2].size() && 
                        s[s1][i] != '?' && 
                        s[s2][i-p] != '?' && 
                        s[s1][i] != s[s2][i-p]){
                        ng[s1][s2][p] = true;
                    }
                    if(i >= s[s1].size() && i - p >= s[s2].size()){
                        break;
                    }
                }
            }
        }
    }
    ll ans = INF;
    for(ll p1=0;p1<3*n;p1++){
        for(ll p2=p1;p2<3*n;p2++){
            ans = min(ans, calc(p1, p2));
        }
    }
    p(ans);

}

int main(){
    // init();
    //ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    ll q;
    if(multicase){
        cin >> q;
    }else{
        q = 1;
    }
    while(q--){
        solve();
    }
    return 0;

}


















Measured memory_bytes: 384