#include #define REP(i, x, n) for(int i = x; i < (int)(n); i++) #define rep(i, n) REP(i, 0, n) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define F first #define S second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; // typedef pair P; int main() { // ios_base::sync_with_stdio(false); int G, C, P; string S; cin >> G >> C >> P; cin >> S; int g, c, p; g = c = p = 0; rep(i, S.size()) { if(S[i] == 'G') g++; if(S[i] == 'C') c++; if(S[i] == 'P') p++; } int ans = 0; ans += min(G, c) * 3; ans += min(C, p) * 3; ans += min(P, g) * 3; G = max(0, G - c); C = max(0, C - p); P = max(0, P - g); g = max(0, c - G); c = max(0, p - C); p = max(0, g - P); ans += min(G, g); ans += min(C, c); ans += min(P, p); cout << ans << endl; return 0; }