#include <bits/stdc++.h>
#define maxn 5086

using namespace std;

int n;
int son[maxn * maxn][3], val[maxn * maxn];
int cnt;
int ans = 1e9;
char s[3][maxn];

void solve(){
	for(int i = 1;i <= cnt;i++) memset(son[i], 0, sizeof(son[i])), val[i] = 1e9;
	cnt = 1;
	for(int i = 0;i < n;i++){
		bool tag = false;
		for(int j = 1;j <= n;j++){
			int jj = j + i;
			if(jj > n) jj -= n;
			if(s[1][jj] == s[0][j]) tag = true;
		}
		if(tag) continue;
		int now = 1;
		for(int j = 1;j <= n;j++){
			int jj = j + i;
			if(jj > n) jj -= n;
			int k = 3 - (s[1][jj] - 'A' + s[0][j] - 'A');
			if(!son[now][k]) son[now][k] = ++cnt;
			now = son[now][k];
		}
		val[now] = min(val[now], min(i, n - i));
	}
	for(int i = 0;i < n;i++){
		int now = 1;
		for(int j = 1;j <= n;j++){
			int jj = j + i;
			if(jj > n) jj -= n;
			int k = s[2][jj] - 'A';
			if(!son[now][k]) break;
			now = son[now][k];
		}
		ans = min(ans, val[now] + min(i, n - i));
	}
}

int main(){
	memset(val, 0x3f, sizeof(val));
	for(int i = 0;i < 3;i++) scanf("%s", s[i] + 1);
	n = strlen(s[0] + 1);
	solve();
	for(int i = 1;i <= n;i++) swap(s[0][i], s[1][i]);
	solve();
	for(int i = 1;i <= n;i++) swap(s[0][i], s[2][i]);
	solve();
	printf("%d", ans == 1e9 ? -1 : ans);
}