#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

int main() {
    ll x, y, z;
    cin >> x >> y >> z;

    char s, t;
    ll ss, tt;
    cin >> s >> ss >> t >> tt;
    if ((s == 'B' && t == 'A') || (s == 'C' && t == 'B') ||
        (s == 'C' && t == 'A')) {
        swap(s, t);
        swap(ss, tt);
    }
    ll ans = INF, tmp1 = INF, tmp2 = INF, tmp3 = INF, tmp4 = INF;
    if (s == 'A' && t == 'A') {
        tmp1 = max(tt, ss) - min(tt, ss);
        tmp2 = min(ss, tt) + y + x - max(ss, tt);
        tmp3 = min(ss, tt) + z + x - max(ss, tt);
    } else if (s == 'B' && t == 'B') {
        tmp1 = max(tt, ss) - min(tt, ss);
        tmp2 = min(ss, tt) + x + y - max(ss, tt);
        tmp3 = min(ss, tt) + z + y - max(ss, tt);
    } else if (s == 'C' && t == 'C') {
        tmp1 = max(tt, ss) - min(tt, ss);
        tmp2 = min(ss, tt) + y + z - max(ss, tt);
        tmp3 = min(ss, tt) + x + z - max(ss, tt);
    } else if ((s == 'A' && t == 'B')) {
        tmp1 = ss + tt - 1;
        tmp2 = x - ss + y - tt + 1;
        tmp3 = ss + z + y - tt;
        tmp4 = x - ss + z + tt;
    } else if ((s == 'B' && t == 'C')) {
        tmp1 = ss + tt - 1;
        tmp2 = z - ss + y - tt + 1;
        tmp3 = ss + x + z - tt;
        tmp4 = y - ss + x + tt;
    } else {
        tmp1 = ss + tt - 1;
        tmp2 = x - ss + z - tt + 1;
        tmp3 = ss + y + z - tt;
        tmp4 = x - ss + y + tt;
    }

    ans = min(tmp1, min(tmp2, min(tmp3, tmp4)));
    cout << ans << endl;
}