#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(bA(3);cin>>A; string S;cin>>S; vectorB(3); REP(i,sz(S)){ if(S[i]=='G')B[0]++; if(S[i]=='C')B[1]++; if(S[i]=='P')B[2]++; } vectorC(3);REP(i,3)C[i]=min(A[i],B[(i+1)%3]); ll ans=3*(C[0]+C[1]+C[2]); REP(i,3)A[i]-=C[i]; REP(i,3)B[(i+1)%3]-=C[i]; REP(i,3)C[i]=min(A[i],B[i]); ans+=C[0]+C[1]+C[2]; cout<