from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def cntwin(me,you,ans):
        win=min(me,you)
        me-=win
        you-=win
        ans+=win*3
        return me,you,ans

    g,c,p=MI()
    s=input()
    fg=fc=fp=0
    for h in s:
        if h=="G":fg+=1
        elif h=="C":fc+=1
        else:fp+=1
    ans=0
    g,fc,ans=cntwin(g,fc,ans)
    c,fp,ans=cntwin(c,fp,ans)
    p,fg,ans=cntwin(p,fg,ans)
    ans+=min(g,fg)+min(c,fc)+min(p,fp)
    print(ans)

main()