#include <stdio.h>
#include <math.h>

#include <iostream>
#include <vector>
#include <list>
#include <algorithm>

long sub1(long* i, long* y) {
  int temp;
  if( *i >= *y ) {
    temp = *y;
    *i -= *y; 
    *y  = 0;    
    return temp;
  }
  else {
    temp = *i;
    *y -= *i; 
    *i  = 0;
    return temp;    
  }
  return 0;
}    

int main() {

  long i, j;

  long ig, ic, ip;
  long yg, yc, yp;
  std::string str;
  long point;

  std::cin >> ig >> ic >> ip;
  std::cin >> str;

  yg = yc = yp = 0;

  for(i = 0; i < str.length(); i++) {
    if(str[i] == 'G') {
      yg++;
    }
    else if(str[i] == 'C') {
      yc++;
    }
    else if(str[i] == 'P') {
      yp++;
    }
  }

  point = 0;

  point += sub1(&ig, &yc) * 3;
  point += sub1(&ic, &yp) * 3;
  point += sub1(&ip, &yg) * 3;
  
  point += sub1(&ig, &yg);
  point += sub1(&ic, &yc);
  point += sub1(&ip, &yp);

  std::cout << point << std::endl;
  
  return 0;
}