#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string a, b, c;
int m = 6000;
bool ab[20000], ac[20000], bc[20000];

int main()
{
	cin >> a >> b >> c;

	for (int i = 0; i < a.size(); i++)
		for (int j = 0; j < b.size(); j++)
			if (!(a[i] == '?' || b[j] == '?' || a[i] == b[j]))
				ab[i - j + 10000] = true;

	for (int i = 0; i < a.size(); i++)
		for (int j = 0; j < c.size(); j++)
			if (!(a[i] == '?' || c[j] == '?' || a[i] == c[j]))
				ac[i - j + 10000] = true;

	for (int i = 0; i < b.size(); i++)
		for (int j = 0; j < c.size(); j++)
			if (!(b[i] == '?' || c[j] == '?' || b[i] == c[j]))
				bc[i - j + 10000] = true;

	int A = a.size();
	int B = b.size();
	int C = c.size();

	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(A, max(B + i, C + j));
				m = min(m, R - L);
			}
		}
	}

	cout << m << endl;
}

### Prompt

Develop a solution in CPP 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>
#include <string>
#include <algorithm>
using namespace std;

string a, b, c;
int m = 6000;
bool ab[20000], ac[20000], bc[20000];

int main()
{
	cin >> a >> b >> c;

	for (int i = 0; i < a.size(); i++)
		for (int j = 0; j < b.size(); j++)
			if (!(a[i] == '?' || b[j] == '?' || a[i] == b[j]))
				ab[i - j + 10000] = true;

	for (int i = 0; i < a.size(); i++)
		for (int j = 0; j < c.size(); j++)
			if (!(a[i] == '?' || c[j] == '?' || a[i] == c[j]))
				ac[i - j + 10000] = true;

	for (int i = 0; i < b.size(); i++)
		for (int j = 0; j < c.size(); j++)
			if (!(b[i] == '?' || c[j] == '?' || b[i] == c[j]))
				bc[i - j + 10000] = true;

	int A = a.size();
	int B = b.size();
	int C = c.size();

	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(A, max(B + i, C + j));
				m = min(m, R - L);
			}
		}
	}

	cout << m << endl;
}

```