#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 1LL << 61;
const ll mod = 1000000007LL;
//const ll mod = 998244353LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 };
#define endl '\n'
#pragma endregion
#define MAX 222222

char cs, cg;
ll ls, lg;
ll x, y, z;

void dfs(char c, ll cur, ll cnt, ll dist) {
  if (cnt > 4) return;
  if (c == cg) mi = min(mi, dist + llabs(cur - lg));
  if ((c == 'A'&&cur==x)||(c=='B'&&cur==y)||(c=='C'&&cur==z)) {
    char cc = 'A';
    rep(i, 3) {
      if (c != cc) {
        if (cc == 'A') dfs(cc, x, cnt + 1, dist + 1);
        if (cc == 'B') dfs(cc, y, cnt + 1, dist + 1);
        if (cc == 'C') dfs(cc, z, cnt + 1, dist + 1);
      }
      cc += 1;
    }
    dfs(c, 1, cnt + 1, dist + cur - 1);
  }
  else if (cur == 1) {
    char cc = 'A';
    rep(i, 3) {
      if (c != cc) dfs(cc, 1, cnt + 1, dist + 1);
      cc = cc + 1;
    }
    if (c == 'A') dfs(c, x, cnt + 1, dist + llabs(cur - x));
    if (c == 'B') dfs(c, y, cnt + 1, dist + llabs(cur - y));
    if (c == 'C') dfs(c, z, cnt + 1, dist + llabs(cur - z));
  }
  else {
    if (c == 'A') dfs(c, x, cnt + 1, dist + llabs(cur - x));
    if (c == 'B') dfs(c, y, cnt + 1, dist + llabs(cur - y));
    if (c == 'C') dfs(c, z, cnt + 1, dist + llabs(cur - z));
    dfs(c, 1, cnt + 1, dist + cur - 1);
  }
}


int main(void) {
  ios::sync_with_stdio(false); cin.tie(0);


  cin >> x >> y >> z;
  cin >> cs >> ls;
  cin >> cg >> lg;
  dfs(cs, ls, 0, 0);
  cout << mi << endl;



  return 0;
}