#include <bits/stdc++.h>
 
//    #include <boost/multiprecision/cpp_int.hpp>
// #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-8)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
 
                      
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v==0) return b;
                                	if(b==0) return v;
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                            
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
 
              /*                  
                int pr[700100];
                int inv[700010];
                

                
    			int comb(int nn,int rr){
    				if(rr<0 || rr>nn || nn<0) return 0;
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
               
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=((ll)pr[i-1]*i)%mod;
                	}
                		inv[ert]=beki(pr[ert],mod-2,mod);
                	for(int i=ert-1;i>=0;i--){
                		inv[i]=(ll)inv[i+1]*(i+1)%mod;
                	}
                }
                */
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
 //   mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;


int ans=inf;
	string s[3];
	int l[3];

int iti[3][3][2010][2020];

void solve(int a,int b,int c){
	int w[3];
	w[0]=a;
	w[1]=b;
	w[2]=c;
	for(int i=0;i<=l[a];i++){
		for(int j=i;j<=max(l[a],i+l[b]);j++){
	
			
	

			
			pa zen=mp(max({0,i,j}),min({l[a],i+l[b],j+l[c]}));
			if(zen.first<zen.second){
				if(iti[w[0]][w[1]][zen.first][zen.first-i]<zen.second-zen.first) continue;
				if(iti[w[1]][w[2]][zen.first-i][zen.first-j]<zen.second-zen.first) continue;
				if(iti[w[0]][w[2]][zen.first][zen.first-j]<zen.second-zen.first) continue;
				
			}
			
			zen=mp(max(0,i),min(l[a],i+l[b]));
			if(zen.first<zen.second){
				if(iti[w[0]][w[1]][zen.first][zen.first-i]<zen.second-zen.first) continue;
			//	if(iti[w[1]][w[2]][zen.first-i][zen.first-j]<zen.second-zen.first) continue;
			//	if(iti[w[0]][w[2]][zen.first][zen.first-j]<zen.second-zen.first) continue;
				
			}
			
			zen=mp(max(0,j),min(l[a],j+l[c]));
			if(zen.first<zen.second){
			//	if(iti[w[0]][w[1]][zen.first][zen.first-i]<zen.second-zen.first) continue;
			//	if(iti[w[1]][w[2]][zen.first-i][zen.first-j]<zen.second-zen.first) continue;
				if(iti[w[0]][w[2]][zen.first][zen.first-j]<zen.second-zen.first) continue;
				
			}
			zen=mp(max(i,j),min(j+l[c],i+l[b]));
			if(zen.first<zen.second){
			//	if(iti[w[0]][w[1]][zen.first][zen.first-i]<zen.second-zen.first) continue;
				if(iti[w[1]][w[2]][zen.first-i][zen.first-j]<zen.second-zen.first) continue;
			//	if(iti[w[0]][w[2]][zen.first][zen.first-j]<zen.second-zen.first) continue;
				
			}
			ans=min(ans,max({l[a],i+l[b],j+l[c]}));

				
			
		}
		
	}
}

signed main(){
cin.tie(0);
ios::sync_with_stdio(false);

	for(int i=0;i<3;i++)cin>>s[i];
	for(int i=0;i<3;i++)l[i]=s[i].length();
	
	for(int a=0;a<3;a++)for(int b=0;b<3;b++)if(a!=b){
		/*
		for(int sa=0;sa<=4100;sa++){
			iti[a][b][sa]=0;
			
			for(int j=0;;j++){
				int it1=j;
				int it2=j+sa;
				if(l[a]<=j || l[b]<=j+sa){
					iti[a][b][sa]=inf;
					break;
				}
				if(s[a][it1]!=s[b][it2] && s[a][it1]!='?' && s[b][it2]!='?') break;
				iti[a][b][sa]++;
			}
		}*/
		
		for(int i=l[a];i>=0;i--)for(int j=l[b];j>=0;j--){
			if(i==l[a] || j==l[b]){
				iti[a][b][i][j]=0;
				continue;
			}
			if(s[a][i]!=s[b][j] && s[a][i]!='?' && s[b][j] != '?')iti[a][b][i][j]=0;
			else iti[a][b][i][j]=iti[a][b][i+1][j+1]+1;
		}
	}
	
	
	solve(0,1,2);
	solve(0,2,1);
	solve(1,0,2);
	solve(1,2,0);
	solve(2,0,1);
	solve(2,1,0);
	
	cout<<ans<<endl;
return 0;
 }


Measured memory_bytes: 98560