#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)

const ll INF = 1000000000000007LL;
ll d[100][100] = {};
map<string,int> ma;
int m = 1;
ll to(string x){
	if(ma[x])return ma[x];
	ma[x] = m++;
	return ma[x];
}
void conn(char x,int n,char y,int m,ll l){
	d[to(string(x+to_string(n)))][to(string(y+to_string(m)))] = l;
	d[to(string(y+to_string(m)))][to(string(x+to_string(n)))] = l;
}

int main(){
	ll x[3],t[2];
	char s[2],c[3]={'A','B','C'};
	FOR(i,0,3)cin>>x[i];
	FOR(i,0,2)cin>>s[i]>>t[i];
	FOR(i,0,100)FOR(j,0,100)d[i][j]=INF;
	FOR(i,0,3){
		FOR(j,i+1,3){
			conn(c[i],1,c[j],1,1);
			conn(c[i],x[i],c[j],x[j],1);
		}
	}
	FOR(i,0,2){
		conn(s[i],1,s[i],t[i],t[i]-1);
		conn(s[i],x[s[i]-'A'],s[i],t[i],x[s[i]-'A']-t[i]);
	}
	FOR(k,1,m)FOR(i,1,m)FOR(j,1,m){
		d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
	}
	ll ans = d[to(s[0]+to_string(t[0]))][to(s[1]+to_string(t[1]))];
	if(s[0]==s[1])ans = min(ans,abs(t[0]-t[1]));
	cout << ans << endl;
}