// qdd on Jan 29, 2023

#ifdef qdd
#include <ringo>
#else
#include <bits/stdc++.h>
#define dbg(...)
#define dbgr(x, y)
#endif

using namespace std;

using ll = long long;

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v) is >> x;
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  bool f = 0;
  for (const T& x : v) (f ? os << ' ' : os) << x, f = 1;
  return os;
}

string x, y, z;
int n;

int work() {
  unordered_map<string, int> mp;
  for (int i = 0; i < n; i++) {
    string t = z.substr(i) + z.substr(0, i);
    if (!mp.count(t)) {
      mp[t] = min(i, n - i);
    } else {
      mp[t] = min({mp[t], i, n - i});
    }
  }
  int ans = n * 3;
  for (int i = 0; i < n; i++) {
    string u(n, ' ');
    bool nice = true;
    for (int j = 0; j < n; j++) {
      if (x[(i + j) % n] == y[j]) {
        nice = false;
      } else {
        u[j] = 'A' ^ 'B' ^ 'C' ^ x[(i + j) % n] ^ y[j];
      }
    }
    if (nice && mp.count(u)) {
      int offset1 = min(i, n - i);
      int offset2 = mp[u];
      ans = min(ans, offset1 + offset2);
    }
  }
  return ans;
}

void sol() {
  cin >> x >> y >> z;
  n = x.size();
  int ans = work();
  swap(x, y);
  ans = min(ans, work());
  swap(y, z);
  ans = min(ans, work());
  cout << (ans == n * 3 ? -1 : ans) << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  sol();
  return 0;
}