#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int a,b,c;
    cin >> a >> b >> c;
    int d = 0, e = 0, f = 0;
    string s;
    cin >> s;
    int n = s.size();
    rep(i,n){
        if(s[i] == 'G')d++;
        else if(s[i] == 'C')e++;
        else f++;
    }

    int ans = 0;
    int x = min(a,e);
    ans += 3*x;
    a -= x;
    e -= x;
    x = min(b,f);
    ans += 3*x;
    b-=x;
    f-=x;
    x=min(c,d);
    ans+=3*x;
    c-=x;
    d-=x;
    ans += min(a,d)+min(b,e)+min(c,f);
    cout << ans << endl;
    return 0;
}