#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

constexpr ll fir(ll n, ll mi, ll ma){
  return min(max(n, mi), ma);
}

constexpr int NN = 20000;
constexpr int NN2 = 6000;
bool of1[NN];
bool of2[NN];
bool of3[NN];

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  string a, b, c;
  cin >> a >> b >> c;
  ll A = SZ(a);
  ll B = SZ(b);
  ll C = SZ(c);
  fill(of1, of1+NN, true);
  fill(of2, of2+NN, true);
  fill(of3, of3+NN, true);
  auto fu = [&](bool st[], string& s1, string& s2) -> void{
    repr(i, -SZ(s2), SZ(s1)+1){
      bool f = 1;
      rep(j, SZ(s2)){
        if(0 <= i+j && i+j < SZ(s1) && s1[i+j] != '?' && s2[j] != '?' && s1[i+j] != s2[j]){
          f = 0;
          break;
        }
      }
      st[i+NN2] = f;
    }
  };
  fu(of1, a, b);
  fu(of2, b, c);
  fu(of3, a, c);
  //dump(of1, of2, of3);
  ll ans = INF;
  for(ll i = -4000; i <= 4000; i++){
    for(ll j = -4000; j <= 4000; j++){
      if(max(i+B, j+C) < 0 || min(i, j) > A){
        continue;
      }
      if(i+B < 0 && j > A){
        continue;
      }
      if(j+C < 0 && i > A){
        continue;
      }
      /*
      if(of1.count(fir(i, -B, A))
      && of2.count(fir(j-i, -C, B))
      && of3.count(fir(j, -C, A))){
        chmin(ans, max({A, i+B, j+C}) - min({0ll, i, j}));
      }
      */
      if(of1[i+NN2] && of2[j-i+NN2] && of3[j+NN2]){
        chmin(ans, max({A, i+B, j+C}) - min({0ll, i, j}));
      }
    }
  }
  print(ans);
}


Measured memory_bytes: 512