#include <bits/stdc++.h>

using namespace std;

const long long INF = 1LL<<60;

void add(map<string, vector<tuple<string, long long> > > &edges, string x, string y, long long d) {
  edges[x].emplace_back(y, d);
  edges[y].emplace_back(x, d);
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int x, y, z;
  cin >> x >> y >> z;

  map<string, vector<tuple<string, long long> > > edges;
  string a1 = "a1", an = "a" + to_string(x);
  string b1 = "b1", bn = "b" + to_string(y);
  string c1 = "c1", cn = "c" + to_string(z);  
  
  add(edges, a1, an, x-1);
  add(edges, b1, bn, y-1);
  add(edges, c1, cn, z-1);
  add(edges, a1, b1, 1);
  add(edges, b1, c1, 1);
  add(edges, c1, a1, 1);
  add(edges, an, bn, 1);
  add(edges, bn, cn, 1);
  add(edges, cn, an, 1);

  for (int i = 0; i < 2; i++) {
    string s;
    int t;
    cin >> s >> t;
    string v = to_string(i);

    if (s == "A") {
      add(edges, v, a1, abs(1-t));
      add(edges, v, an, abs(x-t));      
    } else if (s == "B") {
      add(edges, v, b1, abs(1-t));
      add(edges, v, bn, abs(y-t));
    } else {
      add(edges, v, c1, abs(1-t));
      add(edges, v, cn, abs(z-t));
    }
  }

  map<string, long long> dist {
    {a1, INF}, {b1, INF}, {c1, INF},
    {an, INF}, {bn, INF}, {cn, INF},
    {"0", 0}, {"1", INF}
  };
  priority_queue<pair<long long, string>, vector<pair<long long, string>>, greater<pair<long long, string>> > q;
  q.emplace(0, "0");

  while (!q.empty()) {
    string v;
    long long d;
    tie(d, v) = q.top();
    q.pop();

    if (d > dist[v])
      continue;
    
    for (auto &[w, cost]: edges[v]) {
      if (d + cost < dist[w]) {
        dist[w] = d + cost;
        q.emplace(dist[w], w);
      }
    }
  }
  cout << dist["1"] << endl;
  
  return 0;
}