#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int main(int argc, char **argv) {
	int G, C, P;
	string S;
	cin >> G >> C >> P >> S;
	int n = S.length();
	int g2 = 0, c2 = 0, p2 = 0;
	REP(i, n) {
		if (S[i] == 'G') ++g2;
		else if (S[i] == 'C') ++c2;
		else ++p2;
	}
	int g = min(G, c2), c = min(C, p2), p = min(P, g2);
	int res = (g + c + p) * 3;
	G -= g; C -= c; P -= p; c2 -= g; p2 -= c; g2 -= p;
	g = min(G, g2); c = min(C, c2); p = min(P, p2);
	res += g + c + p;
	cout << res << endl;
	return 0;
}