#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll,ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define INF 100000000
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(x) x.begin(),x.end() 
#define SIZE(x) ll(x.size()) 
//定数
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //問題による
#define F first
#define S second
//出力(空白区切りで昇順に)
#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<" ";cout<<*--x.end()<<endl
#define coutALLn(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<endl;cout<<*--x.end()<<endl
ll myceil(ll a,ll b){return (a+(b-1))/b;}
ll myfloor(ll a,ll b){return a/b;}

int main(){
    int G,C,P ;
    cin >> G >> C >> P;
    vector<int> cnt0 = {G,C,P};
    string S;
    cin >> S;
    int N = S.size();
    vector<int> cnt(3,0);
    rep(i,N){
        if (S[i] == 'C'){
            cnt[0]++;
        }
        else if (S[i] == 'P'){
            cnt[1]++;
        }
        else{
            cnt[2]++;
        }
    }
    int ans = 0;
    rep(i,3){
        int v = min(cnt0[i],cnt[i]);
        ans += v * 3;
        cnt0[i] -= v;
        cnt[i] -= v;
    }
    rep(i,3){
        int v = min(cnt0[i],cnt[(i+2)%3]);
        ans += v;
    }
    cout << ans << endl;

}