#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 5050;
void solve()
{
	string a, b, c;
	cin >> a;
	cin >> b;
	cin >> c;
	int n = a.size();
	vector<int> flag12(n + 1, 0), flag13(n + 1, 0), flag23(n + 1, 0);
	function<void(string, string, vector<int>&)> getflag =
		[&](string s1, string s2, vector<int>& now) {
			int n = a.size();
			for (int i = 0; i < n; i++) {
				int flag = 1;
				for (int j = 0; j < n; j++) {
					int res = (j + i) % n;
					if (s1[j] == s2[res]) {
						flag = 0;
						break;
					}
				}
				now[i] = flag;
			}
		};
	getflag(a, b, flag12);
	getflag(a, c, flag13);
	getflag(b, c, flag23);
	int ans = inf;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			int k = (i + j) % n;
			if (flag12[i] && flag23[j] && flag13[k]) {
				int res1 = min(i, n - i) + min(j, n - j);
				int res2 = min(i, n - i) + min(k, n - j);
				int res3 = min(j, n - j) + min(k, n - k);
				int res = min(res1, min(res2, res3));
				ans = min(ans, res);
			}
		}
	}
	if (ans == inf)
		ans = -1;
	cout << ans << el;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}