#include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define EPS 1e-8
#define LL_INF 0x3fffffffffffffff
#define INF 0x3f3f3f3f3f3f3f3f
#define MEM(a, b) memset(a, b, sizeof(a))
#define PPER(i, n, m) for (int i = n; i >= m; i--)
#define REPP(i, n, m) for (int i = n; i <= m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define PER(i, n, m) for (int i = n; i > m; i--)
#define SA(n) scanf("%d", &(n))
#define SLLA(n) scanf("%lld", &(n))
#define MP make_pair
#define FF first
#define SS second
#define PB push_back
#define DE(val) cout << #val << ": " << val << endl;

const int dx44[6] = {0, -1, -1, 1, 1};
const int dy44[6] = {0, -1, 1, -1, 1};
const int dx4[6] = {0, 1, 0,-1};
const int dy4[6] = {-1, 0, 1,0};
const int dx8[9] = {0, -1, 0, 1, 0, 1, 1, -1, -1};
const int dy8[9] = {0, 0, 1, 0, -1, 1, -1, 1, -1};
const int dx82[9] = {0, -1, -1, 1, 1, 2, 2, -2, -2};
const int dy82[9] = {0, 2, -2, 2, -2, 1, -1, 1, -1};
void update(ll& x,ll v){
    if(x==-1)x=v;
    else if(x>v)x=v;
}

ll po(ll a, ll b, ll mod)
{
    ll res = 1;
    a %= mod;
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}
ll gcd(ll a, ll b)
{
    if (a == 0)
    {
        return b;
    }
    else
    {
        return gcd(b % a, a);
    }
}
void extgcd(ll a, ll b, ll &d, ll &x, ll &y)
{
    if (!b)
    {
        d = a;
        x = 1;
    }
    else
    {
        extgcd(b, a % b, d, y, x);
        y -= x * (a / b);
    }
}
ll inverse(ll a, ll n)
{
    ll d, x, y;
    extgcd(a, n, d, x, y);
    return d == 1 ? (x + n) % n : -1;
}
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const int maxn = 6e5 + 5;
const double PI = acos(-1.0);
const ll mod = 1000000007;
/*************************************************************************/

int ab[maxn], ac[maxn], bc[maxn];

string aa, bb, cc;

void solve() {
    cin >> aa >> bb >> cc;
    int mid = 1e5;

    REP(i,0,aa.length()) {
        REP(j,0,bb.length()) {
            if(!(aa[i] == bb[j] || aa[i] == '?' || bb[j] == '?')) {
                ab[i - j + mid] = 1;
            }
        }
   }

   REP(i,0,aa.length()) {
        REP(j,0,cc.length()) {
            if(!(aa[i] == cc[j] || aa[i] == '?' || cc[j] == '?')) {
                ac[i - j + mid] = 1;
            }
        }
   }

   REP(i,0,bb.length()) {
        REP(j,0,cc.length()) {
            if(!(bb[i] == cc[j] || bb[i] == '?' || cc[j] == '?')) {
                bc[i - j + mid] = 1;
            }
        }
   }

   int ans = aa.length() + bb.length() + cc.length();
   REPP(i,-4000, 4000) {
    REPP(j, -4000, 4000) {
        if(!ab[i + mid] && !ac[j + mid] && !bc[j - i + mid]) {
            int minn = min({0, i, j});
            int maxx = max({(int)aa.length(), (int)bb.length() + i, (int)cc.length() + j});
            ans = min(ans, maxx - minn );
        }
    }
   }
   cout<<ans<<endl;

}


int main()
{
// #ifndef ONLINE_JUDGE
//   freopen("i.txt", "r", stdin);
//   freopen("o.txt", "w", stdout);
// #endif
  solve();
  return 0;
}





Measured memory_bytes: 4480