#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028L;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

string a, b, c;
int hoge(string a, string b, string c) {
    bool ab[11000], bc[11000], ac[11000];
    rep(i, 11000) {
        ab[i] = true;
        rep(j, b.length()) {
            if (j + i >= a.length()) { break; }
            if (a[j + i] != '?' && b[j] != '?' && a[j + i] != b[j]) { ab[i] = false; }
        }
        bc[i] = true;
        rep(j, c.length()) {
            if (j + i >= b.length()) { break; }
            if (b[j + i] != '?' && c[j] != '?' && b[j + i] != c[j]) { bc[i] = false; }
        }
        ac[i] = true;
        rep(j, c.length()) {
            if (j + i >= a.length()) { break; }
            if (a[j + i] != '?' && c[j] != '?' && a[j + i] != c[j]) { ac[i] = false; }
        }
    }
    int ret = LLONG_MAX;
    rep(i, 5500) {
        rep(j, 5500) {
            if (!ab[i] || !bc[j] || !ac[i + j]) { continue; }
            int cur = LLONG_MIN;
            chmax(cur, (int) a.length());
            chmax(cur, (int) b.length() + i);
            chmax(cur, (int) c.length() + i + j);
            //dump(cur);
            chmin(ret, cur);
        }
    }
    return ret;
}
signed main() {
    cin >> a >> b >> c;
    int ans = LLONG_MAX;
    chmin(ans, hoge(a, b, c));
    chmin(ans, hoge(a, c, b));
    chmin(ans, hoge(b, a, c));
    chmin(ans, hoge(b, c, a));
    chmin(ans, hoge(c, a, b));
    chmin(ans, hoge(c, b, a));
    cout << ans << endl;
}


Measured memory_bytes: 256