#include <bits/stdc++.h>
using namespace std;
# define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;

int match(char a, char b){
    
    if(a==b || a=='?'||b=='?'){
        return true;
    }else{
        return false;
    }
}

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);
    string a,b,c;
    cin>>a>>b>>c;
    ll A = a.length();
	ll B = b.length();
	ll C = c.length();
    bool ab[20000],ac[20000],bc[20000];
    rep(i,A){
        rep(j,B){
            if(!match(a[i],b[j])){
                ab[i-j+10000] = true;
            }
        }
    }
    rep(i,A){
        rep(j,C){
            if(!match(a[i],c[j])){
                ac[i-j+10000] = true;
            }
        }
    }
    rep(i,B){
        rep(j,C){
            if(!match(b[i],c[j])){
                bc[i-j+10000] = true;
            }
        }
    }
    ll M = 2000;
    ll ans = M*3;
    for (int i= -2*M;i<=2*M;i++){
        for(int j= -2*M;j<=2*M;j++){
            if(!ab[i+10000]&& !ac[j+10000]&&!bc[j-i+10000]){
                ll L = min(0,min(i,j));
                ll R = max(A,max(B+i,C+j));
                ans = min(ans,R-L);
            }
        }
    }

    cout<<ans<<"\n";

    return 0;
}
### Prompt

Please formulate a CPP solution to the following problem:

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 <bits/stdc++.h>
using namespace std;
# define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;

int match(char a, char b){
    
    if(a==b || a=='?'||b=='?'){
        return true;
    }else{
        return false;
    }
}

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);
    string a,b,c;
    cin>>a>>b>>c;
    ll A = a.length();
	ll B = b.length();
	ll C = c.length();
    bool ab[20000],ac[20000],bc[20000];
    rep(i,A){
        rep(j,B){
            if(!match(a[i],b[j])){
                ab[i-j+10000] = true;
            }
        }
    }
    rep(i,A){
        rep(j,C){
            if(!match(a[i],c[j])){
                ac[i-j+10000] = true;
            }
        }
    }
    rep(i,B){
        rep(j,C){
            if(!match(b[i],c[j])){
                bc[i-j+10000] = true;
            }
        }
    }
    ll M = 2000;
    ll ans = M*3;
    for (int i= -2*M;i<=2*M;i++){
        for(int j= -2*M;j<=2*M;j++){
            if(!ab[i+10000]&& !ac[j+10000]&&!bc[j-i+10000]){
                ll L = min(0,min(i,j));
                ll R = max(A,max(B+i,C+j));
                ans = min(ans,R-L);
            }
        }
    }

    cout<<ans<<"\n";

    return 0;
}
```