#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef long long ll;

int calc(char c1,char c2) {
    if(c1==c2) return 1;
    if(c1=='G'&&c2=='P') return 3;
    if(c1=='P'&&c2=='C') return 3;
    if(c1=='C'&&c2=='G') return 3;
    return 0;
}

template<class T>
bool chmax(T &a, const T &b) {
    if(a<b) {
        a=b;
        return true;
    }
    return false;
}
int G,C,P;
string S;
/*
int dfs(int idx,int g,int c,int p) {
    if(idx==S.size()) return 0;
    int ret = 0;
    if(dp[idx][g][c][p]!=-1) return dp[idx][g][c][p];
    if(g!=0) ret = max(dfs(idx+1,g-1,c,p)+calc(S[idx],'G'), ret);
    if(c!=0) ret = max(dfs(idx+1,g,c-1,p)+calc(S[idx],'C'), ret);
    if(p!=0) ret = max(dfs(idx+1,g,c,p-1)+calc(S[idx],'P'), ret);

    return dp[idx][g][c][p]=ret;
}
*/

int dp[2][301][301][301];
int main() {
    cin>>G>>C>>P;
    cin>>S;
    rep(i,S.size()) {
        rep(x,G+1) rep(y,C+1) rep(z,P+1) {
            int g=x;
            int c=y;
            int p=z;
            chmax(dp[(i+1)&1][g+1][c][p],dp[(i&1)][g][c][p]+calc(S[i],'G'));
            chmax(dp[(i+1)&1][g][c+1][p],dp[(i&1)][g][c][p]+calc(S[i],'C'));
            chmax(dp[(i+1)&1][g][c][p+1],dp[(i&1)][g][c][p]+calc(S[i],'P'));
            
            //if(g!=0) chmax(dp[(i&1)][g][c][p],dp[(i+1)&1][g-1][c][p]+calc(S[i],'G'));
            //if(c!=0) chmax(dp[(i&1)][g][c][p],dp[(i+1)&1][g][c-1][p]+calc(S[i],'C'));
            //if(p!=0) chmax(dp[(i&1)][g][c][p],dp[(i+1)&1][g][c][p-1]+calc(S[i],'P'));
        }
    }
    cout<<dp[S.size()&1][G][C][P]<<endl;

    //cout<<dfs(0,G,C,P)<<endl;

    return 0;
}