package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	x := getNextInt(scanner)
	y := getNextInt(scanner)
	z := getNextInt(scanner)
	s0 := getNextString(scanner)
	t0 := getNextInt(scanner)
	s1 := getNextString(scanner)
	t1 := getNextInt(scanner)
	fw := makeGrid(4, 4)
	for i := 0; i < 4; i++ {
		for j := 0; j < 4; j++ {
			if i == j {
				continue
			}
			fw[i][j] = math.MaxInt32
		}
	}
	if s0 == s1 {
		fw[0][1] = abs(t0-t1) << 1
		fw[1][0] = abs(t0-t1) << 1
	}
	fw[0][2] = t0<<1 - 1
	fw[2][0] = t0<<1 - 1
	fw[1][2] = t1<<1 - 1
	fw[2][1] = t1<<1 - 1
	fw[2][3] = min(x, min(y, z)) << 1
	fw[3][2] = min(x, min(y, z)) << 1
	switch s0 {
	case "A":
		fw[0][3] = (x-t0)<<1 + 1
		fw[3][0] = (x-t0)<<1 + 1
	case "B":
		fw[0][3] = (y-t0)<<1 + 1
		fw[3][0] = (y-t0)<<1 + 1
	case "C":
		fw[0][3] = (z-t0)<<1 + 1
		fw[3][0] = (z-t0)<<1 + 1
	}
	switch s1 {
	case "A":
		fw[1][3] = (x-t1)<<1 + 1
		fw[3][1] = (x-t1)<<1 + 1
	case "B":
		fw[1][3] = (y-t1)<<1 + 1
		fw[3][1] = (y-t1)<<1 + 1
	case "C":
		fw[1][3] = (z-t1)<<1 + 1
		fw[3][1] = (z-t1)<<1 + 1
	}

	for k := 0; k < 4; k++ {
		for i := 0; i < 4; i++ {
			for j := 0; j < 4; j++ {
				if fw[i][j]-fw[i][k] > fw[k][j] {
					fw[i][j] = fw[i][k] + fw[k][j]
				}
			}
		}
	}
	fmt.Fprintln(writer, fw[0][1]>>1)
}
func makeGrid(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}
func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}
func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}