#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 2e3 + 10;
int lcp[3][3][N][N];

void get_lcp(const string& s, const string& t, int dp[N][N]) {
  int n = s.size(), m = t.size();
  for (int i = 0; i < n; ++i) dp[i][m] = 0;
  for (int j = 0; j < m; ++j) dp[n][j] = 0;
  for (int i = n - 1; i >= 0; --i) {
    for (int j = m - 1; j >= 0; --j) {
      if (s[i] == '?' || t[j] == '?' || s[i] == t[j]) {
        dp[i][j] = dp[i + 1][j + 1] + 1;
      } else {
        dp[i][j] = 0;
      }
    }
  }
}

int main() {
  string s[3];
  for (int i = 0; i < 3; ++i) cin >> s[i];
  int ret = INF;
  for (int i = 0; i < 3; ++i) {
    swap(s[i], s[0]);
    for (int j = 0; j < 3; ++j) {
      for (int k = j + 1; k < 3; ++k) {
        get_lcp(s[j], s[k], lcp[j][k]);
      }
    }
    for (int X = 0; X <= s[0].size() + s[2].size(); ++X) {
      if (X < s[0].size() &&
          lcp[0][1][X][0] < min(s[0].size() - X, s[1].size())) continue;
      for (int Y = 0; Y <= s[0].size() + s[1].size(); ++Y) {
        if (Y < s[0].size() &&
            lcp[0][2][Y][0] < min(s[0].size() - Y, s[2].size())) continue;
        bool conflict = false;
        if (X <= Y && Y < X + s[1].size() &&
            lcp[1][2][Y - X][0] < min(s[1].size() - (Y - X), s[2].size())) conflict = true;
        if (Y <= X && X < Y + s[2].size() &&
            lcp[1][2][0][X - Y] < min(s[2].size() - (X - Y), s[1].size())) conflict = true;
        if (!conflict) {
          // if (X == 0 && Y == 0) {
          //   trace(s[0], s[1], s[2], X, Y);
          //   trace(lcp[0][1][X][0], lcp[0][2][Y][0], lcp[1][2][Y - X][0]);
          // }
          int len = s[0].size();
          len = max(len, (int)s[1].size() + X);
          len = max(len, (int)s[2].size() + Y);
          ret = min(ret, len);
        }
      }
    }
  }
  printf("%d\n", ret);
  return 0;
}


Measured memory_bytes: 53504