#include <bits/stdc++.h>

using namespace std;

int main(){
    string a, b, c;
    cin >> a >> b >> c;
    
    vector<bool> ab(16001), bc(16001), ca(16001);
    for (int i = -2000; i <= 2000; i++){
        for (int j = 0; j < 2000; j++){
            if (0 <= j - i and j - i < b.size() and j < a.size() and a[j] != '?' and b[j - i] != '?' and a[j] != b[j - i])
                ab[i + 8000] = true;
            if (0 <= j - i and j - i < c.size() and j < b.size() and b[j] != '?' and c[j - i] != '?' and b[j] != c[j - i])
                bc[i + 8000] = true;
            if (0 <= j - i and j - i < a.size() and j < c.size() and c[j] != '?' and a[j - i] != '?' and c[j] != a[j - i])
                ca[i + 8000] = true;
        }
    }

    int ans = 1e8;
    for (int i = -4000; i < 4000; i++){
        for (int j = -4000; j < 4000; j++){
            if (!ab[i + 8000] and !bc[j - i + 8000] and !ca[-j + 8000]){
                int r = max({int(a.size()), int(b.size()) + i, int(c.size()) + j});
                int l = min({0, i, j});
                ans = min(ans, r - l);
            }
        }
    }

    cout << ans << endl;
}
### Prompt

Construct a cpp code solution to the problem outlined:

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;

int main(){
    string a, b, c;
    cin >> a >> b >> c;
    
    vector<bool> ab(16001), bc(16001), ca(16001);
    for (int i = -2000; i <= 2000; i++){
        for (int j = 0; j < 2000; j++){
            if (0 <= j - i and j - i < b.size() and j < a.size() and a[j] != '?' and b[j - i] != '?' and a[j] != b[j - i])
                ab[i + 8000] = true;
            if (0 <= j - i and j - i < c.size() and j < b.size() and b[j] != '?' and c[j - i] != '?' and b[j] != c[j - i])
                bc[i + 8000] = true;
            if (0 <= j - i and j - i < a.size() and j < c.size() and c[j] != '?' and a[j - i] != '?' and c[j] != a[j - i])
                ca[i + 8000] = true;
        }
    }

    int ans = 1e8;
    for (int i = -4000; i < 4000; i++){
        for (int j = -4000; j < 4000; j++){
            if (!ab[i + 8000] and !bc[j - i + 8000] and !ca[-j + 8000]){
                int r = max({int(a.size()), int(b.size()) + i, int(c.size()) + j});
                int l = min({0, i, j});
                ans = min(ans, r - l);
            }
        }
    }

    cout << ans << endl;
}
```