#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>
#include <unordered_map>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int cnt[3];
	rep(i, 3) cin >> cnt[i];

	int cnt2[3];
	string s;
	cin >> s;
	rep(i, 3) cnt2[i] = count(ALL(s), "GCP"[i]);

	int ans = 0;
	for (int j = 1; j >= 0; --j){
		int pnt[] = { 1, 3 };
		rep(i, 3){
			int k = (i + j) % 3;
			int x = min(cnt[i], cnt2[k]);
			cnt[i] -= x;
			cnt2[k] -= x;
			ans += x * pnt[j];
		}
	}
	cout << ans << endl;
}