import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

long[3] X;
string[2] S;
long[2] T;

void main() {
  try {
    for (; ; ) {
      foreach (i; 0 .. 3) {
        X[i] = readLong();
      }
      foreach (u; 0 .. 2) {
        S[u] = readToken();
        T[u] = readLong();
      }
      
      enum V = 8;
      auto d = new long[][](V, V);
      foreach (u; 0 .. V) foreach (v; 0 .. V) {
        d[u][v] = (u == v) ? 0 : INF;
      }
      foreach (i; 0 .. 3) {
        const v0 = 2 + i * 2 + 0;
        const v1 = 2 + i * 2 + 1;
        chmin(d[v0][v1], X[i] - 1);
        chmin(d[v1][v0], X[i] - 1);
      }
      foreach (u; [2, 4, 6]) foreach (v; [2, 4, 6]) {
        chmin(d[u][v], 1);
      }
      foreach (u; [3, 5, 7]) foreach (v; [3, 5, 7]) {
        chmin(d[u][v], 1);
      }
      foreach (u; 0 .. 2) {
        const i = S[u][0] - 'A';
        const v0 = 2 + i * 2 + 0;
        const v1 = 2 + i * 2 + 1;
        chmin(d[v0][u], T[u] - 1);
        chmin(d[u][v0], T[u] - 1);
        chmin(d[v1][u], X[i] - T[u]);
        chmin(d[u][v1], X[i] - T[u]);
      }
      if (S[0] == S[1]) {
        chmin(d[0][1], abs(T[0] - T[1]));
        chmin(d[1][0], abs(T[0] - T[1]));
      }
      
      foreach (w; 0 .. V) foreach (u; 0 .. V) foreach (v; 0 .. V) {
        chmin(d[u][v], d[u][w] + d[w][v]);
      }
      writeln(d[0][1]);
    }
  } catch (EOFException e) {
  }
}