#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include "bits/stdc++.h"

using namespace std;

const int inf = (int) 1e9;
int z[(int) 5e3 * 3 + 1];
string s;

void z_function() {
    int n = (int) s.size();
    int l = 0, r = 0;
    for (int i = 1; i < n; i++) {
        z[i] = max(0, min(r - i, z[i - l]));
        while (i + z[i] < n && s[z[i]] == s[z[i] + i]) z[i]++;
        if (i + z[i] > r) {
            l = i, r = i + z[i];
        }
    }
}

int solve2(const string& a, string b, const string& c) {
    int ans = inf, n = (int) a.size();
    for (int k = 0; k < n; k++) {
        bool ok = true;
        string need(n, 'a');
        for (int i = 0; i < n; i++) {
            if (a[i] == b[i]) {
                ok = false;
            }
            if (a[i] != 'A' && b[i] != 'A') {
                need[i] = 'A';
            }
            if (a[i] != 'B' && b[i] != 'B') {
                need[i] = 'B';
            }
            if (a[i] != 'C' && b[i] != 'C') {
                need[i] = 'C';
            }
        }
        if (ok) {
            s = need + "#" + c + c;
            z_function();
            for (int j = n + 1; j <= 2 * n; j++) {
                if (z[j] == n) {
                    ans = min(ans, k + j - (n + 1));
                    break;
                }
            }
        }
        b.insert(b.begin(), b.back());
        b.pop_back();
    }
    return ans;
}

int solve(const string& a, const string& b, const string& c) {
    return min(solve2(a, b, c), solve2(a, c, b));
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string a, b, c;
    cin >> a >> b >> c;
    int ans = min({solve(a, b, c), solve(b, a, c), solve(c, a, b)});
    cout << (ans == inf ? -1 : ans);
}