#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int INF = 1e9;
int valid[3][3][5005], dp[5005][5005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    string s[3];
    for (int i = 0; i < 3; ++i)
        cin >> s[i];
    n = SZ(s[0]);
    for (int i = 0; i < 3; ++i)
        for (int j = i + 1; j < 3; ++j) {
            for (int k = 0; k < n; ++k) {
                valid[i][j][k] = 1;
                for (int p = 0; p < n; ++p)
                    if (s[i][p] == s[j][(k + p) % n])
                        valid[i][j][k] = 0;
            }
        }
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            dp[i][j] = INF;
    queue<pii> q;
    auto relax = [&](int a, int b, int v) {
        a = (a % n + n) % n, b = (b % n + n) % n;
        if (dp[a][b] > v) {
            q.push(pii(a, b));
            dp[a][b] = v;
        }
    };
    int ans = INF;
    relax(0, 0, 0);
    while (!q.empty()) {
        auto [a, b] = q.front();
        q.pop();
        if (valid[0][1][a] && valid[0][2][b] && valid[1][2][(b - a + n) % n]) {
            ans = min(ans, dp[a][b]);
        }
        relax(a + 1, b + 1, dp[a][b] + 1);
        relax(a - 1, b - 1, dp[a][b] + 1);
        relax(a + 1, b, dp[a][b] + 1);
        relax(a - 1, b, dp[a][b] + 1);
        relax(a, b + 1, dp[a][b] + 1);
        relax(a, b - 1, dp[a][b] + 1);
    }
    if (ans == INF) cout << "-1\n";
    else cout << ans << "\n";
}