#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  vector<long long> xyz(3); REP(i, 3) cin >> xyz[i];
  char s0, s1; long long t0, t1; cin >> s0 >> t0 >> s1 >> t1;
  long long t2 = xyz[s0 - 'A'] - t0, t3 = xyz[s1 - 'A'] - t1;
  long long ans = LINF;
  if (s0 == s1) ans = abs(t1 - t0);
  ans = min(ans, t0 + t1 - 1);
  ans = min(ans, t2 + t3 + 1);
  ans = min(ans, t0 + *min_element(ALL(xyz)) + t3);
  ans = min(ans, t2 + *min_element(ALL(xyz)) + t1);
  cout << ans << '\n';
  return 0;
}