#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
int mod = 998244353;
// int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) solve();
}

// youtube editorial
void solve() {
  vector<string> s(3);
  cin >> s;

  auto solve = [&](vector<string> s) {
    // cout << s << endl;
    // 0, 1, 2 の順番として考える
    auto calc = [&](int x, int y) {
      vector<int> v(4005);
      // 0, 1
      rep(i, 4000 + 1) { // 1 をどれだけずらすか
        rep(j, sz(s[y]) + 1) { // debuged, +1, i = 0 で通り抜ける
          if (i + j >= sz(s[x]) || j == sz(s[y])) { // ok, debuged, j == sz(s[y])
            v[i] = 1;
            break;
          }
          // if (i == 0) cout << j << " " << s[x][i + j] << " " << s[y][j] << endl;
          if (s[x][i + j] != '?' && s[y][j] != '?' && s[x][i + j] != s[y][j]) {
            v[i] = 0;
            break;
          }
        }
      }
      return v;
    };
    vector<int> v01 = calc(0, 1), v02 = calc(0, 2), v12 = calc(1, 2), v21 = calc(2, 1);
    // for (auto e : mp01) if (e.F <= 10) cout << e.F << " " << e.S << endl;
    int ret = inf;
    rep(i, sz(s[0]) + 1) rep(j, sz(s[0]) + sz(s[1]) + 1) { // debuged, 基準は常に 0
      // cout << i << " " << j << " " << mp01[i] << " " << mp02[j] << " ";
      // if (j - i < 0) cout << mp21[i - j]; else cout << mp12[j - i]; cout << endl;
      bool tmp = 1;
      if (!(v01[i] && v02[j])) tmp = 0;
      if (j - i < 0) tmp &= v21[i - j];
      else tmp &= v12[j - i];
      if (tmp) chmin(ret, max({sz(s[0]), i + sz(s[1]), j + sz(s[2])})); // debuged
    }
    // cout << ret << endl;
    return ret;
  };

  int ans = inf;
  sort(all(s));
  do {
    chmin(ans, solve(s));
  } while (next_permutation(all(s)));
  // chmin(ans, solve(s));
  cout << ans << endl;
}
/*
a c? ddac?dd?
aadb? cbd db
ada?dba db dcddd

dddbada?d bdcd ba
*/


Measured memory_bytes: 384