#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;
list<long long int> Prime(int M) {
	list<long long int>P;
	P.push_back(2);
	P.push_back(3);
	for (int i = 5; i <= M; i += 6) {
		bool flag = true;
		for (auto j : P) {
			if (i%j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i);
		flag = true;
		for (auto j : P) {
			if ((i + 2) % j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i + 2);
	}
	return P;
}

long long int N, M, K, Q;
long long int ans;

int g, c, p;
int G, C, P;
string s;
int box;

int main() {
	ios::sync_with_stdio(false);
	cin >> g >> c >> p;
	cin >> s;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'G')G++;
		if (s[i] == 'C')C++;
		if (s[i] == 'P')P++;
	}
	box = min(g, C);
	ans += 3 * box;
	g -= box;
	C -= box;
	box = min(c, P);
	ans += 3 * box;
	c -= box;
	P -= box;
	box = min(p, G);
	ans += 3 * box;
	p -= box;
	G -= box;
	ans += min(g, G);
	ans += min(p, P);
	ans += min(c, C);
	cout << ans << endl;
	return 0;
}