#include <bits/stdc++.h>
using namespace std;
#define L long long
#ifdef LOCAL
#define dbg(x) cerr << '[' << #x << " = " << (x) << "]\n";
#else
#define dbg(x)
#endif
// g++ -std=c++17 -O2 -DLOCAL -o a a.cpp

int main() {
    cin.tie(0)->sync_with_stdio(0);
    string a, b, c;
    cin >> a >> b >> c;
    int n = a.size();
    int best = INT_MAX;
    for (int t = 0; t < 3; t++) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            bool succ = true;
            for (int k = 0; k < n; k++) {
                if (a[k] == b[(k+i)%n] || a[k] == c[(k+j)%n] || b[(k+i)%n] == c[(k+j)%n]) {
                    succ = false;
                    break;
                }
            }
            if (succ) {
                best = min(best, min(n-i,i) + min(n-j,j));
            }
        }
    }
    swap(a,b);
    swap(b,c);
    }
    if (best == INT_MAX) best = -1;
    cout << best << '\n';
}