#include <iostream>
using namespace std;
int ab[10000],bc[10000],ac[10000],ans=6000,na,nb,nc,L,R;
string a,b,c;
bool ch(char a,char b){
    return (a==b||a=='?'||b=='?');
}
int main(void){
    cin>>a>>b>>c;
    na=a.size();
    nb=b.size();
    nc=c.size();
    for(int i=0;i<na;i++){
        for(int j=0;j<nb;j++){
            if(!ch(a[i],b[j]))ab[i-j+5000]=1;
        }
    }
    for(int i=0;i<na;i++){
        for(int j=0;j<nc;j++){
            if(!ch(a[i],c[j]))ac[i-j+5000]=1;
        }
    }
    for(int i=0;i<nb;i++){
        for(int j=0;j<nc;j++){
            if(!ch(b[i],c[j]))bc[i-j+5000]=1;
        }
    }
    for(int i=-4000;i<=4000;i++){
        for(int j=-4000;j<=4000;j++){
            if(ab[i+5000]==0&&ac[j+5000]==0&&bc[j-i+5000]==0){
                L=min(0,min(i,j));
                R=max(na,max(i+nb,j+nc));
                //cout<<ans<<" "<<R<<L<<endl;
                ans=min(ans,R-L);
            }
        }
    }
    cout<<ans<<endl;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

Snuke has a string s. From this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:

* Choose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with `?`s.



For example, if s is `mississippi`, we can choose the substring `ssissip` and replace its 1-st and 3-rd characters with `?` to obtain `?s?ssip`.

You are given the strings a, b, and c. Find the minimum possible length of s.

Constraints

* 1 \leq |a|, |b|, |c| \leq 2000
* a, b, and c consists of lowercase English letters and `?`s.

Input

Input is given from Standard Input in the following format:


a
b
c


Output

Print the minimum possible length of s.

Examples

Input

a?c
der
cod


Output

7


Input

atcoder
atcoder
???????


Output

7

### Response

```cpp
#include <iostream>
using namespace std;
int ab[10000],bc[10000],ac[10000],ans=6000,na,nb,nc,L,R;
string a,b,c;
bool ch(char a,char b){
    return (a==b||a=='?'||b=='?');
}
int main(void){
    cin>>a>>b>>c;
    na=a.size();
    nb=b.size();
    nc=c.size();
    for(int i=0;i<na;i++){
        for(int j=0;j<nb;j++){
            if(!ch(a[i],b[j]))ab[i-j+5000]=1;
        }
    }
    for(int i=0;i<na;i++){
        for(int j=0;j<nc;j++){
            if(!ch(a[i],c[j]))ac[i-j+5000]=1;
        }
    }
    for(int i=0;i<nb;i++){
        for(int j=0;j<nc;j++){
            if(!ch(b[i],c[j]))bc[i-j+5000]=1;
        }
    }
    for(int i=-4000;i<=4000;i++){
        for(int j=-4000;j<=4000;j++){
            if(ab[i+5000]==0&&ac[j+5000]==0&&bc[j-i+5000]==0){
                L=min(0,min(i,j));
                R=max(na,max(i+nb,j+nc));
                //cout<<ans<<" "<<R<<L<<endl;
                ans=min(ans,R-L);
            }
        }
    }
    cout<<ans<<endl;
}

```