#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int g_y = 0,c_y = 0,p_y = 0,g_f = 0,c_f = 0,p_f = 0;
	string str;
	cin >> g_y >> c_y >> p_y;
	cin >> str;
	for(int i = 0;i < str.size();i++){
		if(str[i] == 'G') g_f++;
		else if(str[i] == 'C') c_f++;
		else if(str[i] == 'P') p_f++;
	}
	int point = 0;
	if(g_y >= c_f) {
		point += 3 * c_f;
		g_y -= c_f;
		c_f = 0;
	}else{
		point += 3 * g_y;
		c_f -= g_y;
		g_y = 0;
	}

	if(c_y >= p_f){
		point += 3 * p_f;
		c_y -= p_f;
		p_f = 0;
	}else{
		point += 3 * c_y;
		p_f -= c_y;
		c_y = 0;
	}

	if(p_y >= g_f){
		point += 3 * g_f;
		p_y -= g_f;
		g_f = 0;
	}else{
		point += 3 * p_y;
		g_f -= p_y;
		p_y = 0;
	}

	point += min(g_f,g_y) + min(c_y,c_f) + min(p_y,p_f);

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