#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i < int(e); i++)
#define FORIT(i,c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ISEQ(c) (c).begin(), (c).end()

int main(){
	int G,C,P;
	cin >> G >> C >> P;
	string s;
	cin >> s;

	int count[3] = {0};
	FOR(i,0,s.length()){
		if(s[i] == 'G') count[0]++;
		else if(s[i] == 'C') count[1]++;
		else if(s[i] == 'P') count[2]++;
	}

	int point = 0;
	if(G > count[1]){
		point += count[1]*3;
		G = G - count[1];
		count[1] = 0;
	}else{
		point += G*3;
		count[1] -= G;
		G = 0;
	}

	if(C > count[2]){
		point += count[2]*3;
		C = C - count[2];
		count[2] = 0;
	}else{
		point += C*3;
		count[2] -= C;
		C = 0;
	}

	if(P > count[0]){
		point += count[0]*3;
		P = P - count[0];
		count[0] = 0;
	}else{
		point += P*3;
		count[0] -= P;
		P = 0;
	}

	if(G>0){
		point += min(G,count[0]);
	}
	if(C>0){
		point += min(C,count[1]);
	}
	if(P>0){
		point += min(P,count[2]);
	}

	cout << point << endl;
	return 0;
}