#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

int ab[20000];
int bc[20000];
int ca[20000];

bool equal(string x, string y, int i, int j, int len) {
  for (int k=0; k<len; k++) {
    char xx = x[i+k];
    char yy = y[j+k];
    if (xx != '?' && yy != '?' && xx != yy) return false;
  }
  return true;
}

int main() {
  string a,b,c;
  while(cin>>a>>b>>c) {
    int A=a.size();
    int B=b.size();
    int C=c.size();

    int ans = INF;

    REP(i,20000) ab[i]=bc[i]=ca[i]=-1;

    for (int i=-B-C; i<=A+C; i++) {
      int ab_lft = max(0,i);
      int ab_rgt = min(A,i+B);
      int ab_len = ab_rgt-ab_lft;

      int lft=min(0,i)-C;
      int rgt=max(A,i+B);
      for (int j=lft; j<=rgt; j++) {
        int ac_lft = max(0,j);
        int ac_rgt = min(A,j+C);
        int ac_len = ac_rgt-ac_lft;

        int bc_lft = max(i,j);
        int bc_rgt = min(i+B,j+C);
        int bc_len = bc_rgt-bc_lft;

        // a == b
        bool f1 = 1;
        if (ab_len > 0) {
          int hoge = i+B+C+C;
          if (ab[hoge] == -1) {
            ab[hoge] = equal(a,b,ab_lft,ab_lft-i,ab_len);
          }
          f1 = ab[hoge];
        }
        // b == c
        bool f2 = 1;
        if (bc_len > 0) {
          int hoge = j-i+B+C+C;
          if (bc[hoge] == -1) {
            bc[hoge] = equal(b,c,bc_lft-i,bc_lft-j,bc_len);
          }
          f2 = bc[hoge];
        }
        // a == c
        bool f3 = 1;
        if (ac_len > 0) {
          int hoge = j+B+C+C;
          if (ca[hoge] == -1) {
            ca[hoge] = equal(a,c,ac_lft,ac_lft-j,ac_len);
          }
          f3 = ca[hoge];
        }

        if (f1 && f2 && f3) {
          // cout << tpl(i,j,' ',ab_len,ac_len,bc_len,max(max(A,i+B),j+C)-min(min(0,i),j)) << endl;
          chmin(ans, max(max(A,i+B),j+C)-min(min(0,i),j));
        }
      }
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 512