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

using ll = long long;
const int MN = 5e3+5, MOD = 1e9+7, HN = 1;

int N, ar[3][MN], need[MN]; ll pw[HN][MN], pc[HN][3][MN], needH[HN]; string ss[3];

ll getHsh(int h, int *a) {
  ll ret = 0;
  for (int i = 0; i < N; i++)
    ret += a[i] * pw[h][i];
  return ret %MOD;
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  for (int s = 0; s < 3; s++)
    cin >> ss[s];
  N = ss[0].size();
  for (int s = 0; s < 3; s++)
    for (int i = 0; i < N; i++)
      ar[s][i] = ss[s][i] - 'A' + 1;
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()*0+3);
  uniform_int_distribution<int> dist(5, 20);
  for (int h = 0; h < HN; h++) {
    pw[h][0] = 1;
    pw[h][1] = dist(rng);
    for (int i = 2; i < N; i++)
      pw[h][i] = pw[h][i-1] * pw[h][1] %MOD;
    for (int s = 0; s < 3; s++) {
      ll pvH = getHsh(h, ar[s]);
      for (int i = 0; i < N; i++) {
        pc[h][s][i] = pvH;
        pvH = ((pvH + MOD - ar[s][N-1-i] * pw[h][N-1]%MOD) * pw[h][1] + ar[s][N-1-i]) %MOD;
      }
    }
  }
  int ans = 1e9;
  for (int s = 0; s < 3; s++) {
    int s1 = (s+1) %3, s2 = (s+2) %3;
    for (int r1 = 0; r1 < N; r1++) {
      bool b = 1;
      for (int i = 0, i1 = (N-r1)%N; i < N; i++, i1 = (i1 == N-1 ? 0 : i1+1)) {
        b &= ar[s][i] != ar[s1][i1];
        need[i] = 6 - ar[s][i] - ar[s1][i1];
      }
      if (!b) continue;
      for (int h = 0; h < HN; h++)
        needH[h] = getHsh(h, need);
      for (int r2 = 0; r2 < N; r2++) {
        bool b1 = 1;
        for (int h = 0; h < HN; h++)
          b1 &= pc[h][s2][r2] == needH[h];
        if (b1) ans = min(ans, min(r1, N-r1) + min(r2, N-r2));
      }
    }
  }
  printf("%d\n", ans == 1e9 ? -1 : ans);

  return 0;
}