#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ab[15000],ac[15000],bc[15000];
int main(){
	string a,b,c;
	cin>>a>>b>>c;
	int lena=a.length(),lenb=b.length(),lenc=c.length(),ans=lena+lenb+lenc;
	for(int i=0;i<lena;i++){
		for(int j=0;j<lenb;j++){
			if(a[i]!='?'&&b[j]!='?'&&a[i]!=b[j]) ab[i-j+10000]=true;
		}
	}
	for(int i=0;i<lena;i++){
		for(int j=0;j<lenc;j++){
			if(a[i]!='?'&&c[j]!='?'&&a[i]!=c[j]) ac[i-j+10000]=true;
		}
	}
	for(int i=0;i<lenb;i++){
		for(int j=0;j<lenc;j++){
			if(b[i]!='?'&&c[j]!='?'&&b[i]!=c[j]) bc[i-j+10000]=true;
		}
	}
	for(int i=-4000;i<=4000;i++){
		for(int j=-4000;j<=4000;j++){
			if(!ab[i+10000]&&!ac[j+10000]&&!bc[j-i+10000]){
				int l=min(0,min(i,j));
				int r=max(lena,max(lenb+i,lenc+j));
				ans=min(ans,r-l);
			}
		}
	}
	cout<<ans<<endl;
}
### Prompt

Your task is to create 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;
typedef long long ll;
bool ab[15000],ac[15000],bc[15000];
int main(){
	string a,b,c;
	cin>>a>>b>>c;
	int lena=a.length(),lenb=b.length(),lenc=c.length(),ans=lena+lenb+lenc;
	for(int i=0;i<lena;i++){
		for(int j=0;j<lenb;j++){
			if(a[i]!='?'&&b[j]!='?'&&a[i]!=b[j]) ab[i-j+10000]=true;
		}
	}
	for(int i=0;i<lena;i++){
		for(int j=0;j<lenc;j++){
			if(a[i]!='?'&&c[j]!='?'&&a[i]!=c[j]) ac[i-j+10000]=true;
		}
	}
	for(int i=0;i<lenb;i++){
		for(int j=0;j<lenc;j++){
			if(b[i]!='?'&&c[j]!='?'&&b[i]!=c[j]) bc[i-j+10000]=true;
		}
	}
	for(int i=-4000;i<=4000;i++){
		for(int j=-4000;j<=4000;j++){
			if(!ab[i+10000]&&!ac[j+10000]&&!bc[j-i+10000]){
				int l=min(0,min(i,j));
				int r=max(lena,max(lenb+i,lenc+j));
				ans=min(ans,r-l);
			}
		}
	}
	cout<<ans<<endl;
}
```