#include <bits/stdc++.h>

using namespace std;
const int MAXN = 2005;
char a[MAXN], b[MAXN], c[MAXN];
bool ab[MAXN * 5], ac[MAXN * 5], bc[MAXN * 5];
int main()
{

    scanf("%s%s%s", a, b, c);
    int lena = strlen(a), lenb = strlen(b), lenc = strlen(c);
    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 + 4000] = 1;
            }
        }
    }
    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 + 4000] = 1;
            }
        }
    }
    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 + 4000] = 1;
            }
        }
    }
    int ans = 1e9;
    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 = min(0, min(i, j));
                int R = max(lena, max(lenb + i, lenc + j));
                ans = min(ans, R - L);
            }
        }
    }
    printf("%d\n", ans);
    int t;
    cin >> t;
    // cout << '1';
}
### 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;
const int MAXN = 2005;
char a[MAXN], b[MAXN], c[MAXN];
bool ab[MAXN * 5], ac[MAXN * 5], bc[MAXN * 5];
int main()
{

    scanf("%s%s%s", a, b, c);
    int lena = strlen(a), lenb = strlen(b), lenc = strlen(c);
    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 + 4000] = 1;
            }
        }
    }
    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 + 4000] = 1;
            }
        }
    }
    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 + 4000] = 1;
            }
        }
    }
    int ans = 1e9;
    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 = min(0, min(i, j));
                int R = max(lena, max(lenb + i, lenc + j));
                ans = min(ans, R - L);
            }
        }
    }
    printf("%d\n", ans);
    int t;
    cin >> t;
    // cout << '1';
}
```