#pragma warning (disable :4996)
#include <bits/stdc++.h>
#define ll long long
#define eps 1e-7
using namespace std;

const int mod = 1e9 + 7;
const int maxn = 1e5;
string s1, s2, s3;
bool ab[maxn], ac[maxn], bc[maxn];
bool match(char a, char b) {
	return a == b || a == '?' || b == '?';
}
int res = maxn;
int main(){
	cin >> s1 >> s2 >> s3;
	int a, b, c;
	a = s1.length(), b = s2.length(), c = s3.length();
	for (int i = 0; i < a; ++i) for (int j = 0; j < b; ++j) if (!match(s1[i], s2[j])) ab[i - j + 4000] = 1;
	for (int i = 0; i < a; ++i) for (int j = 0; j < c; ++j) if (!match(s1[i], s3[j])) ac[i - j + 4000] = 1;
	for (int i = 0; i < b; ++i) for (int j = 0; j < c; ++j) if (!match(s2[i], s3[j])) bc[i - j + 4000] = 1;
	for (int i = -4000; i <= 4000; ++i) {
		for (int j = -4000; j <= 4000; ++j) {
			if (!ab[i + 4000] && !ac[j + 4000] && !bc[j - i + 4000]) {
				int l, r;

				l = min(0, min(i, j)), r = max(a, max(b + i, c + j));
				res = min(res, r - l);
			}
		}
	}
	cout << res << 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
#pragma warning (disable :4996)
#include <bits/stdc++.h>
#define ll long long
#define eps 1e-7
using namespace std;

const int mod = 1e9 + 7;
const int maxn = 1e5;
string s1, s2, s3;
bool ab[maxn], ac[maxn], bc[maxn];
bool match(char a, char b) {
	return a == b || a == '?' || b == '?';
}
int res = maxn;
int main(){
	cin >> s1 >> s2 >> s3;
	int a, b, c;
	a = s1.length(), b = s2.length(), c = s3.length();
	for (int i = 0; i < a; ++i) for (int j = 0; j < b; ++j) if (!match(s1[i], s2[j])) ab[i - j + 4000] = 1;
	for (int i = 0; i < a; ++i) for (int j = 0; j < c; ++j) if (!match(s1[i], s3[j])) ac[i - j + 4000] = 1;
	for (int i = 0; i < b; ++i) for (int j = 0; j < c; ++j) if (!match(s2[i], s3[j])) bc[i - j + 4000] = 1;
	for (int i = -4000; i <= 4000; ++i) {
		for (int j = -4000; j <= 4000; ++j) {
			if (!ab[i + 4000] && !ac[j + 4000] && !bc[j - i + 4000]) {
				int l, r;

				l = min(0, min(i, j)), r = max(a, max(b + i, c + j));
				res = min(res, r - l);
			}
		}
	}
	cout << res << endl;
}


```