#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << "\n";
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

vector<int> kmp(const auto &s) {
  vector<int> f(s.size());
  for (int i = 1, j = 0; i < (int)s.size(); i++) {
    while (j && s[j] != s[i]) j = f[j - 1];
    f[i] = (j += (s[j] == s[i]));
  }
  return f;
}

vector<int> search(const auto &t, const auto &s) {
  auto f = kmp(s);
  vector<int> res;
  for (int i = 0, j = 0; i < (int)t.size(); i++) {
    while (j && s[j] != t[i]) j = f[j - 1];
    if (s[j] == t[i])
      ++j;
    if (j == (int)s.size()) {
      res.push_back(i - s.size() + 1);
      j = f[j - 1];
    }
  }
  return res;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  string A, B, C;
  cin >> A >> B >> C;

  const int n = (int)B.size();
  const int inf = 1e8;

  string S = C + C;
  S.pop_back();

  int ans = inf;

  for (int i = 0; i < n; i++) {
    auto t = B;
    rotate(t.begin(), t.begin() + i, t.end());
    
    bool ok = true;
    string F;
    for (int x = 0; x < n; x++) {
      if (A[x] == t[x]) {
        ok = false;
        break;
      }

      char ch = 'A' ^ 'B' ^ 'C' ^ A[x] ^ t[x];
      F += ch;
    }
    if (!ok)
      continue;
    safe;

    debug(S, F);
    queue<int> q;
    vector<int> v(n, inf);
    for (int pos : search(S, F)) {
      debug(pos);
      v[pos] = 0;
      q.push(pos);
    }

    while (!q.empty()) {
      int p = q.front(); q.pop();
      for (int r : {(p + 1) % n, (p + n - 1) % n}) {
        if (v[r] == inf) {
          v[r] = v[p] + 1;
          q.push(r);
        }
      }
    }

    orange(all(v));

    for (int x = 0; x < n; x++) {
      int y = (x + i) % n;
      debug(x, y, v[(n - x) % n]);
      ans = min(ans, min(x, n - x) + min(y, n - y) + v[(n - x) % n]);
    }

  }

  if (ans == inf)
    cout << -1 << '\n';
  else
    cout << ans << '\n';

  return 0;
}