#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using u64 = uint64_t;

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

struct chash {
    u64 operator()(u64 x) const {
        x ^= x << 17;
        x ^= x >> 33;
        x ^= x << 11;
        x ^= x >> 23;
        return x;
    }
};

using ull = u64;

struct H {
	ull x; H(ull x=0) : x(x) {}
	H operator+(H o) { return x + o.x + (x + o.x < x); }
	H operator-(H o) { return *this + ~o.x; }
	H operator*(H o) { auto m = (__uint128_t)x * o.x;
		return H((ull)m) + (ull)(m >> 64); }
	ull get() const { return x + !~x; }
	bool operator==(H o) const { return get() == o.get(); }
	bool operator<(H o) const { return get() < o.get(); }
};

// template <int MOD>
// int shash(const string& s, int base) {
//     long ans = 0;
//     for (auto& a : s) {
//         ans = (ans * base + a - 'A' + 1) % MOD;
//     }
//     return int(ans);
// }

// u64 shash(const string& s) {
//     return shash<int(1e9 + 7)>(s, 112);
//     // constexpr int m1 = 1e9 + 7, m2 = 1e9 + 9;
//     // return (u64(shash<m1>(s, 5)) << 32) | shash<m2>(s, 5);
// }

u64 shash(const string& s) {
    H ans = 0;
    for (auto& a : s) {
        ans = (ans * 1412 + a + 330);
    }
    return ans.get();
}

int solve(string a, string b, string c) {
    int n = sz(a);
    __gnu_pbds::gp_hash_table<u64, int, chash> mp;
    for (int i = 0; i < n; i++) {
        auto it = mp.insert({shash(c), i}).first;
        it->second = min(it->second, i);
        rotate(c.begin(), c.begin() + 1, c.end());        
    }
    int ans = 1e9;
    for (int i = 0; i < n; i++) {
        string nc(n, '0');
        for (int j = 0; j < n; j++) {
            nc[j] = 'A' ^ 'B' ^ 'C' ^ a[j] ^ b[j];
        }
        auto it = mp.find(shash(nc));
        if (it != mp.end()) {
            ans = min(ans, i + it->second);
        }
        rotate(b.begin(), b.begin() + n - 1, b.end());
    }
    return ans;
}

void solve() {
    string arr[3];
    for (auto& a : arr) {
        cin >> a;
    }
    int ans = 1e9, perm[3] {0, 1, 2};
    do {
        ans = min(ans, solve(arr[perm[0]], arr[perm[1]], arr[perm[2]]));
    } while (next_permutation(begin(perm), end(perm)));
    if (ans == 1e9) {
        cout << -1 << endl;
    } else {
        cout << ans << endl;
    }
}

int main() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
    solve();
}