#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int a[3] = {};
	string s;
	cin >> a[0] >> a[1] >> a[2] >> s;
	int na[3] = {};
	REP(i, s.size()) {
		if (s[i] == 'G') na[0]++;
		if (s[i] == 'C') na[1]++;
		if (s[i] == 'P') na[2]++;
	}
	int ans = 0;
	REP(i, 3) {
		if (a[i] != 0 && na[(i + 1) % 3] != 0) {
			int t = min(a[i], na[(i + 1) % 3]);
			ans += t * 3;
			a[i] -= t;
			na[(i + 1) % 3] -= t;
		}
	}
	REP(i, 3) {
		if (a[i] != 0 && na[i] != 0) {
			ans += min(a[i], na[i]);
			a[i] -= min(a[i], na[i]);
			na[i] -= min(a[i], na[i]);
		}
	}
	cout << ans << endl;
	return 0;
}