#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int G,C,P,g,c,p;
    cin >> G >> C >> P;
    string S;
    cin >> S;
    
    g = c = p = 0;
    for ( int i = 0; i < S.length(); i++ ) {
        if ( S[i] == 'G' ) { g++; }
        else if ( S[i] == 'C' ) { c++; }
        else { p++; }
    }
    
    int ans = 0;
    
    ans += min( G, c )*3 + min( P, g )*3 + min( C, p )*3;
    
    int G2 = max( 0, G-c );
    int C2 = max( 0, C-p );
    int P2 = max( 0, P-g );
    
    g = max( 0, g-P );
    c = max( 0, c-G );
    p = max( 0, p-C );
    
    ans += min( G2, g ) + min( C2, c ) + min( P2, p );    
    
    cout << ans << endl;
    
    return 0;
}