#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) std::cout<<(p)<<std::endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	int G,C,P;
	string S;
	cin>>G>>C>>P>>S;
	
	int aG=0;
	int aC=0;
	int aP=0;
	for(unsigned int i=0;i<S.size();++i){
		if(S[i] == 'G'){
			++aG;
		}
		else if(S[i] == 'C'){
			++aC;
		}
		else if(S[i] == 'P'){
			++aP;
		}
	}

	int ans = 0;

	int dif;
	dif = min(G,aC);
	G  -= dif;
	aC -= dif;
	ans += 3*dif;

	dif = min(C,aP);
	C  -= dif;
	aP -= dif;
	ans += 3*dif;

	dif = min(P,aG);
	P  -= dif;
	aG -= dif;
	ans += 3*dif;

	///////////
	dif = min(G,aG);
	G  -= dif;
	aG -= dif;
	ans += dif;

	dif = min(C,aC);
	C  -= dif;
	aC -= dif;
	ans += dif;

	dif = min(P,aP);
	P  -= dif;
	aP -= dif;
	ans += dif;

	P(ans);

	return 0;
}