#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    vi a(3);
    rep(i, 3) cin >> a[i];
    string s;
    cin >> s;
    map<char, int> mp{{'G', 0}, {'C', 1}, {'P', 2}};
    vector dp(a[0] + 1, vector(a[1] + 1, vector(a[2] + 1, -1e9)));
    dp[a[0]][a[1]][a[2]] = 0;
    repr(i, a[0] + 1) repr(j, a[1] + 1) repr(k, a[2] + 1) {
        int x = a[0] + a[1] + a[2] - (i + j + k);
        if (x == s.size()) continue;
        auto c = s[x];
        if (i > 0) {
            if (mp[c] == 1) chmax(dp[i - 1][j][k], dp[i][j][k] + 3);
            else if (mp[c] == 0) chmax(dp[i - 1][j][k], dp[i][j][k] + 1);
            else chmax(dp[i - 1][j][k], dp[i][j][k]);
        }
        if (j > 0) {
            if (mp[c] == 2) chmax(dp[i][j - 1][k], dp[i][j][k] + 3);
            else if (mp[c] == 1) chmax(dp[i][j - 1][k], dp[i][j][k] + 1);
            else chmax(dp[i][j - 1][k], dp[i][j][k]);
        }
        if (k > 0) {
            if (mp[c] == 0) chmax(dp[i][j][k - 1], dp[i][j][k] + 3);
            else if (mp[c] == 2) chmax(dp[i][j][k - 1], dp[i][j][k] + 1);
            else chmax(dp[i][j][k - 1], dp[i][j][k]);
        }
    }
    int ans = dp[0][0][0];
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}