#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

void solve() {
  string a, b, c;
  cin >> a >> b >> c;
  vstr abc = {a, b, c};
  sort(all(abc));
  int ans = 1e9;
  do {
    string a = abc[0];
    string b = abc[1];
    string c = abc[2];
    vector<bool> ab(2001);
    vector<bool> bc(2001);
    vector<bool> ac(2001);
    repc(i, 2000) {
      {
        bool ok = true;
        rep(j, 2000 - i) {
          if (i + j >= a.size()) break;
          if (j >= b.size()) break;
          if (a[i + j] == '?' || b[j] == '?') continue;
          if (a[i + j] != b[j]) {
            ok = false;
            break;
          }
        }
        ab[i] = ok;
      }
      {
        bool ok = true;
        rep(j, 2000 - i) {
          if (i + j >= b.size()) break;
          if (j >= c.size()) break;
          if (b[i + j] == '?' || c[j] == '?') continue;
          if (b[i + j] != c[j]) {
            ok = false;
            break;
          }
        }
        bc[i] = ok;
      }
      {
        bool ok = true;
        rep(j, 2000 - i) {
          if (i + j >= a.size()) break;
          if (j >= c.size()) break;
          if (a[i + j] == '?' || c[j] == '?') continue;
          if (a[i + j] != c[j]) {
            ok = false;
            break;
          }
        }
        ac[i] = ok;
      }
    }
    repc(i, 2000) repc(j, 2000) {
      int ab_ = i;
      int bc_ = j;
      int ac_ = i + j;
      if (ab[ab_] && bc[bc_] && (ac_ > 2000 || ac[ac_])) {
        ans = min({ans, max({(int) a.size(), ab_ + (int) b.size(), ac_ + (int) c.size()})});
      }
    }
  } while (next_permutation(all(abc)));
  cout << ans << endl;
}


Measured memory_bytes: 384