#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define sz(x) ((int)(x).size())

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
const ll MOD = 1000000007;
//const ll MOD = 998244353;
double EPS = 1e-10;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}


void make_ok(string a, string b, vector<bool> &okAB){
  rep(i, 4010) okAB[i] = 1;
  //AB
  rep(i, 4010){
    rep(j, 4010){
      if(j+i >= sz(a)) continue;
      if(j >= sz(b)) continue;
      if((a[j+i] != '?' && b[j] != '?') && a[j+i] != b[j]){
        okAB[i] = 0;
      }
    }
  }
}

int sub(string a, string b, string c, vector<bool> okAB, vector<bool> okAC, vector<bool> okBC){
  int res = INF;
  rep(i, 2010)rep(j, 2010){
    if(okAB[i] && okAC[i+j] && okBC[j]){
      res = min(res, max(sz(a), max(sz(b)+i, sz(c)+i+j)));
    }
  }
  return res;
}

string a, b, c;

vector<bool> okAB(4010);
vector<bool> okAC(4010);
vector<bool> okBA(4010);
vector<bool> okBC(4010);
vector<bool> okCA(4010);
vector<bool> okCB(4010);


void solve(){
  cin >> a >> b >> c;
  make_ok(a, b, okAB);
  make_ok(a, c, okAC);
  make_ok(b, a, okBA);
  make_ok(b, c, okBC);
  make_ok(c, a, okCA);
  make_ok(c, b, okCB);
  int ans = INF;
  ans = min(ans, sub(a, b, c, okAB, okAC, okBC));
  ans = min(ans, sub(a, c, b, okAC, okAB, okCB));
  ans = min(ans, sub(b, a, c, okBA, okBC, okAC));
  ans = min(ans, sub(b, c, a, okBC, okBA, okCA));
  ans = min(ans, sub(c, a, b, okCA, okCB, okAB));
  ans = min(ans, sub(c, b, a, okCB, okCA, okBA));
  cout << ans << endl;
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  solve();
}


Measured memory_bytes: 256