#include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); // VAR(int, x); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t){std::cin >> t;} templatevoid Scan(First& first,Rest&...rest){std::cin>>first;Scan(rest...);} #define OUT(d) std::cout<<(d); #define FOUT(n, d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<(n);++i) #define RREP(i, n) for(int i=(n)-1;i>=0;--i) #define PAIR std::pair #define IN(a0, y, a1, b0, x, b1) (a0<=y && y b(3); REP(i, a[0]+a[1]+a[2]){ VAR(char, t); switch(t){ case 'G': ++b[0]; break; case 'C': ++b[1]; break; case 'P': ++b[2]; break; } } int point = 0; REP(i, 3){ if(a[i]>b[(i+1)%3]){ point += b[(i+1)%3]*3; a[i] -= b[(i+1)%3]; b[(i+1)%3] = 0; }else{ point += a[i]*3; b[(i+1)%3] -= a[i]; a[i] = 0; } } REP(i, 3){ if(a[i]>b[i]){ point += b[i]; a[i] -= b[i]; b[i] = 0; }else{ point += a[i]; b[i] -= a[i]; a[i] = 0; } } OUT(point)BR; return 0; }