#include<bits/stdc++.h>

using namespace std;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef long long ll;

#define FOR(i, a, b) for (int i = (a); i < (b); i++) 
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto &a : x)
#define rsz resize
#define pb push_back
#define mp make_pair 
#define F first 
#define S second

#define tcT template<class T
tcT> using V = vector<T>;
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)

int n;
string a, b, c;
vb tmp;
vvb ans;

int rots(int i, int j, int k) {
    if (i>j) swap(i,j);
    if (j>k) swap(j,k);
    if (i>j) swap(i,j);
    int ans = k-i;
    ans = min(ans, j-k+n);
    ans = min(ans, i-j+n);
    return ans;
}

int main(){
    cin.tie(0) -> sync_with_stdio(0);
    cin >> a >> b >> c;
    n = a.length();
    tmp.assign(n, true);
    ans.assign(n, vb(n, true));
    F0R(i, n) F0R(j, n) if (a[i]==b[j]) tmp[(i+n-j)%n]=false;
    F0R(i, n) F0R(j, n) if (! tmp[(i+n-j)%n]) ans[i][j] = false;

    tmp.assign(n, true);
    F0R(i, n) F0R(j, n) if (a[i]==c[j]) tmp[(i+n-j)%n]=false;
    F0R(i, n) F0R(j, n) if (! tmp[i]) ans[i][j] = false;

    tmp.assign(n, true);
    F0R(i, n) F0R(j, n) if (b[i]==c[j]) tmp[(i+n-j)%n]=false;
    F0R(i, n) F0R(j, n) if (! tmp[j]) ans[i][j] = false;

    int dist = 1e9;
    F0R(i, n) F0R(j, n) if (ans[i][j]) dist = min(dist, rots(0, i, j));
    if (dist == 1e9) cout << -1 << '\n';
    else cout << dist << '\n';
    return 0;
}