#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
template<typename T>
struct vector2:vector<T>{
  vector2() = default;
  ll offset;
  vector2(ll l,ll r):offset(-l){
    this->assign(r-l,T());
  }
  decltype(auto) operator[](ll pos){
    return this->vector<T>::operator[](pos + offset);
  }
  bool in_range(ll pos){
    ll k = pos + offset;
    return k >= 0 && k < this->size();
  }
  void print(){
    for(auto val:*this){
      cout << val << " ";
    }
    cout << endl;
  }
};
vector2<ll>solve(string a,string b){
  ll na=a.size(),nb=b.size();
  vector2<ll>ret(-nb,na+1);
  rep(i,-nb,na+1){
    bool sw=true;
    rep(j,0,na){
      ll k=j-i;
      //cout<<i spa j spa k<<endl;
      if(k>=0&&k<nb&&a[j]!='?'&&b[k]!='?'&&a[j]!=b[k]){
        //cout<<i spa j spa k spa a[i] spa b[k]<<endl;
        sw=false;
      }
    }
    ret[i]=sw;
  }
  return ret;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  string a,b,c;cin>>a>>b>>c;
  ll na=a.size(),nb=b.size(),nc=c.size();
  auto ab=solve(a,b);
  auto ac=solve(a,c);
  auto bc=solve(b,c);
  res=INF;
  //debug(ab,ab.size());
  //debug(bc,bc.size());
  //debug(ac,ac.size());
  ll sz=4005;
  ll k1=ab.in_range(sz),k2=ab.in_range(-sz);
  rep(i,-sz,sz){
    if(ab.in_range(i)&&!ab[i])continue;
    rep(j,-sz,sz){
      ll kb=j-i;
      if(bc.in_range(kb)&&!bc[kb])continue;
      if(ac.in_range(j)&&!ac[j])continue;
      chmin(res,max({na,i+nb,j+nc})-min({0LL,i,j}));
    }
  }
  cout<<res<<endl;
  return 0;
}


Measured memory_bytes: 384