#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int g[2], c[2], p[2];
string s;

int solve() {
    int l = s.size();
    for (int i = 0; i < l; i++) {
        switch(s[i]) {
        case 'G': g[1]++; break;
        case 'C': c[1]++; break;
        case 'P': p[1]++; break;
        }
    }
    int res = 0, m;
    m = min(g[0], c[1]);
    res += 3 * m;
    g[0] -= m; c[1] -= m;
    m = min(c[0], p[1]);
    res += 3 * m;
    c[0] -= m; p[1] -= m;
    m = min(p[0], g[1]);
    res += 3 * m;
    p[0] -= m; g[1] -= m;
    m = min(g[0], g[1]);
    res += m;
    m = min(c[0], c[1]);
    res += m;
    m = min(p[0], p[1]);
    res += m;
    return res;
}

void input() {
    cin >> g[0] >> c[0] >> p[0];
    cin >> s;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}