#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int mod=1e9+7;

int J[3];
bool used[310];
string s;
map<int, int> m ={{'G',2},{'C',0},{'P',1}};
int ans;
int main(){
    cin>>J[0]>>J[1]>>J[2];
    cin>>s;
    REP(i,0,s.size()){
        if(J[m[s[i]]]>0){
            used[i]=true;
            J[m[s[i]]]--;
            ans+=3;
        }
    }
    REP(i,0,s.size()){
        if(J[(m[s[i]]+1)%3]>0&&!used[i]){
            J[(m[s[i]]+1)%3]--;
            ans+=1;
        }
    }
    p(ans);
    return 0;
}