#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
template <class... T> void dbg(T... x) { char e{}; ((cerr << e << x, e = ' '), ...); }
template <class T> void org(T l, T r) { while (l != r) cerr << ' ' << *l++; cerr << '\n'; }
#define debug(x...) dbg(#x, '=', x, '\n')
#define olist(x...) dbg(#x, '='), org(x)
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define debug(...) ((void)0)
#define olist(...) ((void)0)
#endif
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second

using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using Pt = pair<int, int>;

template <class T> inline constexpr T inf = numeric_limits<T>::max() / 2;
constexpr int mod = 998244353;

template<class T> bool chmin(T &a, T b) { return (b < a and (a = b, true)); }
template<class T> bool chmax(T &a, T b) { return (a < b and (a = b, true)); }
template<class... T> int add(T... x) { int t{}; return (((t += x) %= mod), ...), t; }
template<class... T> int mul(T... x) { i64 t{1}; return (((t *= x) %= mod), ...), t; }
    
void solve() {
    string X, Y, Z;
    cin >> X >> Y >> Z;

    const int n = X.size();
        
    auto cal = [&](string_view a, string_view b) -> vector<bool> {
        vector<bool> f(n, 1);
        for (char c : "ABC") {
            for (int i = 0; i < n; i++) {
                bool s = true;
                for (int j = 0; j < n; j++) {
                    if (a[j] == c and b[(j + i) % n] == c) {
                        s = false;
                        break;
                    }
                }
                f[i] = f[i] & s;
            }
        }
        return f;
    };

    auto xy = cal(X, Y);
    auto xz = cal(X, Z);
    auto yz = cal(Y, Z);

    olist(all(xy));
    olist(all(xz));
    olist(all(yz));

    int ans = inf<int>;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (xy[i] and xz[j] and yz[(j + n - i) % n]) {
                array<int, 3> pos{0, i, j};
                sort(all(pos));
                for (int k = 0; k < 3; k++)
                    chmin(ans, (pos[(k + 2) % 3] - pos[k] + n) % n);
            }

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

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}