#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}

void solve() {
	int g, c, p,ggap,cgap,pgap;
	cin >> g >> c >> p;
	string s;
	cin >> s;
	int te[3];
	int point = 0;
	fill(te, te + 3, 0);
	rep(i, s.length()){
		switch (s[i]){
			case 'G':te[0]++; break;
			case 'C':te[1]++; break;
			case 'P':te[2]++; break;
		}
	}
	ggap = te[1] < g ? g - te[1] : 0;
	cgap = te[2] < c ? c - te[2] : 0;
	pgap = te[0] < p ? p - te[0] : 0;
	rep(i, s.length()){
		switch (s[i]){
		case 'G':if (p > 0){
			point += 3;
			p--;
		}else{
			if (ggap > 0){
				point++;
				ggap--;
			}
		};break;
		case 'C':if (g > 0){
			point += 3;
			g--;
		}
				 else{
					 if (cgap > 0){
						 point++;
						 cgap--;
					 }
				 }; break;
		case 'P':if (c > 0){
			point += 3;
			c--;
		}
				 else{
					 if (pgap > 0){
						 point++;
						 pgap--;
					 }
				 }; break;
		}
	}
	P(point);
}

int main() {
	solve();
	return 0;
}