/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-03 17:35:02
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
#define y1 gfvtydvtd
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 2000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

bool ab[N], bc[N], ac[N];

int solve(string &a, string &b, string &c) {
    rep(i, 0, sz(a)) {
        ab[i] = true;
        rep(j, i, min(sz(a), i + sz(b))) {
            if (a[j] != '?' && b[j - i] != '?' && a[j] != b[j - i]) {
                ab[i] = false;
                break;
            }
        }
    }
    rep(i, 0, sz(a)) {
        ac[i] = true;
        rep(j, i, min(sz(a), i + sz(c))) {
            if (a[j] != '?' && c[j - i] != '?' && a[j] != c[j - i]) {
                ac[i] = false;
                break;
            }
        }
    }
    rep(i, 0, sz(b)) {
        bc[i] = true;
        rep(j, i, min(sz(b), i + sz(c))) {
            if (b[j] != '?' && c[j - i] != '?' && b[j] != c[j - i]) {
                bc[i] = false;
                break;
            }
        }
    }
    int ans = inf;
    rep(i, 0, sz(a) + 1) {
        rep(j, 0, max(sz(a) - i, sz(b)) + 1) {
            bool ok = true;
            if (i < sz(a)) {
                ok &= ab[i];
            }
            if (j < sz(b)) {
                ok &= bc[j];
            }
            if (i + j < sz(a)) {
                ok &= ac[i + j];
            }
            if (ok) {
                setmin(ans, max({sz(a), i + sz(b), i + j + sz(c)}));
            }
        }
    }
    return ans;
}

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    string a, b, c;
    cin >> a >> b >> c;
    int ans = inf;
    setmin(ans, solve(a, b, c));
    setmin(ans, solve(a, c, b));
    setmin(ans, solve(b, a, c));
    setmin(ans, solve(b, c, a));
    setmin(ans, solve(c, a, b));
    setmin(ans, solve(c, b, a));
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 256