#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

#define A first
#define B first
#define SZ(x) int(x.size())

#define FR(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, n) FR(i, 0, n)

string s[3];
int valDiff[5005][3], N;
int f(int x)
{
    if (x > (N + 1) / 2 - 1)
        return x - N;
    return x;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> s[0] >> s[1] >> s[2];
    N = s[0].length();
    FOR(d, N)
    {
        bool works = true;
        FOR(i, N)
        {
            if (s[0][i] == s[1][(i + d) % N])
            {
                works = false;
                break;
            }
        }
        if (works)
            valDiff[d][2] = 1;
    }
    FOR(d, N)
    {
        bool works = true;
        FOR(i, N)
        {
            if (s[0][i] == s[2][(i + d) % N])
            {
                works = false;
                break;
            }
        }
        if (works)
            valDiff[d][1] = 1;
    }
    FOR(d, N)
    {
        bool works = true;
        FOR(i, N)
        {
            if (s[1][i] == s[2][(i + d) % N])
            {
                works = false;
                break;
            }
        }
        if (works)
            valDiff[d][0] = 1;
    }
    int ans = 1000 * 1000 * 1000;
    FOR(fixd, 3)
    {
        vector<int> chang;
        FOR(j, 3)
            if (j != fixd)
                chang.push_back(j);
        FOR(i, N)
        {
            FOR(j, N)
            {
                if (chang[0] < fixd)
                {
                    if (valDiff[N - i][3 - fixd - chang[0]] == 0)
                        continue;
                }
                else
                {
                    if (valDiff[i][3 - fixd - chang[0]] == 0)
                        continue;
                }
                if (chang[1] < fixd)
                {
                    if (valDiff[N - j][3 - fixd - chang[1]] == 0)
                        continue;
                }
                else
                {
                    if (valDiff[j][3 - fixd - chang[1]] == 0)
                        continue;
                }
                if (valDiff[(j - i + N) % N][fixd] == 0)
                    continue;
                ans = min(ans, abs(f(i)) + abs(f(j)));
            }
        }
    }
    if (ans == 1000 * 1000 * 1000)
        cout << -1;
    else
        cout << ans;
}