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

#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
void debug(vector<vector<ll>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
void debug(vector<ll>v,ll n){cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
vector<vector<ll>>vec(ll x, ll y, ll w){
  vector<vector<ll>>v(x,vector<ll>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while((r=x%y)!=0){x=y;y=r;}return y;}
//m.emplace(x,0).fi->se++;

ll MAX_V = 1e5 + 5; //頂点数
struct edge {
    ll to;
    ll cost;
};

//<最短距離, 頂点の番号>using P = pair<ll, ll>;
vector<vector<struct edge>> G(MAX_V); //隣接リスト
vector<ll> d(MAX_V); //各頂点への最短距離
void dijkstra(ll s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(ALL(d), INF);
    d[s] = 0;
    que.push(P(0, s));

    while (!que.empty()) {
        P p = que.top();
        que.pop();
        ll v = p.second;
        if (d[v] < p.first) continue;

        for (ll i=0; i<G[v].size(); i++) {
            struct edge e = G[v][i];
            if (d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}
int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll x[3];cin>>x[0]>>x[1]>>x[2];
  buf=x[0]+x[1]+x[2];
  char p,q;
  ll t0,t1;cin>>p>>t0>>q>>t1;
  ll s0=p-'A',s1=q-'A';
  res=INF;
  for(ll i=0;i<2;i++){
    rep(j,i+1,3){
      struct edge e ={j*2,1};
      G[i*2].push_back(e);
      e ={i*2,1};
      G[j*2].push_back(e);

      e ={j*2+1,1};
      G[i*2+1].push_back(e);
      e ={i*2+1,1};
      G[j*2+1].push_back(e);

      
    }
    struct edge e ={i*2,x[i]-1};
      G[i*2+1].push_back(e);
      e ={i*2+1,x[i]-1};
      G[i*2].push_back(e);
  }
  rep(i,0,3){
    if(s0==i){
      struct edge e ={i*2,abs(t0-1)};
      G[6].push_back(e);
      e ={6,abs(t0-1)};
      G[i*2].push_back(e);

      e ={i*2+1,abs(x[i]-t0)};
      G[6].push_back(e);
      e ={6,abs(x[i]-t0)};
      G[i*2+1].push_back(e);
    }

    if(s1==i){
      struct edge e ={i*2,abs(t1-1)};
      G[7].push_back(e);
      e ={7,abs(t1-1)};
      G[i*2].push_back(e);

      e ={i*2+1,abs(x[i]-t1)};
      G[7].push_back(e);
      e ={7,abs(x[i]-t1)};
      G[i*2+1].push_back(e);
    }
  }
  dijkstra(6);
  cout<<d[7]<<endl;
  return 0;
}