x, y, z = map(int, input().split())
s_line, s_num = input().split()
s_num = int(s_num)
e_line, e_num = input().split()
e_num = int(e_num)

if s_line == e_line:
    print(abs(s_num - e_num))
else:
    # All possible cases for different line transitions
    # A to B
    if s_line == 'A' and e_line == 'B':
        cost = abs(s_num - 1) + 1 + abs(e_num - 1)
    # A to C
    elif s_line == 'A' and e_line == 'C':
        cost1 = abs(s_num - 1) + 1 + (y - 1) + 1 + abs(z - e_num)
        cost2 = abs(x - s_num) + 1 + abs(e_num - 1)
        cost = min(cost1, cost2)
    # B to A
    elif s_line == 'B' and e_line == 'A':
        cost1 = abs(s_num - 1) + 1 + abs(e_num - 1)
        cost2 = abs(y - s_num) + 1 + abs(z - 1) + 1 + abs(x - e_num)
        cost = min(cost1, cost2)
    # B to C
    elif s_line == 'B' and e_line == 'C':
        cost = abs(y - s_num) + 1 + abs(z - e_num)
    # C to A
    elif s_line == 'C' and e_line == 'A':
        cost1 = abs(s_num - 1) + 1 + abs(x - e_num)
        cost2 = abs(z - s_num) + 1 + (y - 1) + 1 + abs(e_num - 1)
        cost = min(cost1, cost2)
    # C to B
    elif s_line == 'C' and e_line == 'B':
        cost = abs(z - s_num) + 1 + abs(y - e_num)
    # B to C
    elif s_line == 'B' and e_line == 'C':
        cost = abs(y - s_num) + 1 + abs(z - e_num)
    # C to B (duplicate case)
    else:
        # All other cases should be handled by above conditions
        cost = 0  # This should theoretically never be reached

    print(cost)