#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

int main() {
  vi n(3);
  rep (i, 3) {
    cin >> n[i];
  }
  vector<pii> s(2);
  rep (i, 2) {
    char c;
    cin >> c;
    s[i].first = c - 'A';
    int x;
    cin >> x;
    x--;
    s[i].second = x;
  }

  ll ans = INF;
  if (s[0].first == s[1].first) {
    ans = abs(s[0].second - s[1].second);
  }

  vll hyou(8, vl(8, INF));
  rep (i, 3) {
    for (int j = i + 1; j < 3; j++) {
      hyou[i][j] = 1;
      hyou[j][i] = 1;
    }
  }
  for (int i = 3; i < 6; i++) {
    for (int j = i + 1; j < 6; j++) {
      hyou[i][j] = 1;
      hyou[j][i] = 1;
    }
  }

  rep (i, 3) {
    int j = i + 3;
    hyou[i][j] = n[i] - 1;
    hyou[j][i] = n[i] - 1;
  }

  rep (i, 2) {
    int rosen = s[i].first;
    int x = s[i].second;
    int u = 6 + i, v = rosen;
    hyou[u][v] = x;
    hyou[v][u] = x;
    v = rosen + 3;
    hyou[u][v] = n[rosen] - 1 - x;
    hyou[v][u] = n[rosen] - 1 - x;
  }

  if (s[0].first == s[1].first) {
    hyou[6][7] = hyou[7][6] = abs(s[0].second - s[1].second);
  }

  rep (i, 8) hyou[i][i] = 0;
  //DEBUG_MAT(hyou);
  rep (i, 8) {
    rep (j, 8) {
      rep (k, 8) {
        hyou[i][j] = min(hyou[i][j], hyou[i][k] + hyou[k][j]);
      }
    }
  }
  cout << hyou[6][7] << endl;
}