import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

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

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


int getPoint(int i, char x) {
	switch (x) {
		case 'G': return [ 1, 0, 3 ][i];
		case 'C': return [ 3, 1, 0 ][i];
		case 'P': return [ 0, 3, 1 ][i];
		default: assert(false);
	}
}

string S;
int[3] A, B;

void main(string[] args) {
	try {
	for (; ; ) {
		foreach (i; 0 .. 3) {
			A[i] = readInt;
		}
		S = readToken;
		foreach (s; S) {
			switch (s) {
				case 'G': ++B[0]; break;
				case 'C': ++B[1]; break;
				case 'P': ++B[2]; break;
				default: assert(false);
			}
		}
		
		auto dp = new int[][][](A[0] + 1, A[1] + 1, A[2] + 1);
		int[3] a;
		for (a[0] = 0; a[0] <= A[0]; ++a[0]) 
		for (a[1] = 0; a[1] <= A[1]; ++a[1]) 
		for (a[2] = 0; a[2] <= A[2]; ++a[2]) 
		{
			const pos = S.length - a.reduce!"a + b";
			if (pos < S.length) {
				int mx;
				foreach (i; 0 .. 3) if (a[i] > 0) {
					--a[i];
					chmax(mx, getPoint(i, S[pos]) + dp[a[0]][a[1]][a[2]]);
					++a[i];
				}
				dp[a[0]][a[1]][a[2]] = mx;
			}
		}
		writeln(dp[A[0]][A[1]][A[2]]);
		
	}
	} catch (EOFException) {}
}