#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE


vector<Int> calc(string a, string b){
  Int n = a.size();
  Int m = b.size();
  vector<Int> res(n + 1);
  for(Int i=0;i<=n;i++){
    Int f = 1;
    for(Int j=0;j<m && f;j++){
      if(i + j >= n) break;
      if(a[i + j] != '?' && b[j] != '?' && a[i + j] != b[j]) f = 0;
    }
    res[i] = f;
  }
  return res;
}

Int solve(string a, string b, string c){
  vector<Int> okAB = calc(a, b);
  vector<Int> okAC = calc(a, c);
  vector<Int> okBC = calc(b, c);
  pr(a, b, c, okAB, okAC, okBC);
  Int n = a.size();
  Int m = b.size();
  Int l = c.size();
  Int res = INF;
  for(Int i=0;i<=n;i++){
    if(okAB[i] == 0) continue;
    Int j = 0;
    while(1){
      if(j >=m && i + j >= n) break;
      if(j < m && i + j >= n && okBC[j]) break;
      if(j >=m && i + j < n && okAC[i + j]) break;
      if(j < m && i + j < n && okAC[i + j] && okBC[j]) break;
      j++;
    }
    Int len = max<Int>({n, i + m, i + j + l, n, m, l});

    pr(a, b, c, i, j, len);
    Min(res, len);
  }
  return res;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  string a, b, c;
  cin>>a>>b>>c;

  string A[3] = {a, b, c};
  Int ans = INF;
  for(Int i=0;i<3;i++)
    for(Int j=0;j<3;j++)
      for(Int k=0;k<3;k++){
        if(i == j || j == k || k == i) continue;
        Int len = solve(A[i], A[j], A[k]);
        pr(A[i], A[j], A[k], len);
        Min(ans, len);
      }
  cout<<ans<<endl;

  return 0;
}


Measured memory_bytes: 384