#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define UB upper_bound #define LB lower_bound #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- string s; set> sa, sa2; int main() { cin >> s; int n = s.size(); sa.insert({ (n + 4) / 5, 0, 0, 0, 0, 0 }); inc(i, s.size()) { int p = -1; inc(j, 6) { if(s[i] == ("KUROI?"[j])) { p = j; } } if(p == -1) { continue; } inc(j, 5) { if(p == j || p == 5) { FOR(it, sa) { auto x = (*it); if(x[j] > 0) { x[j]--; x[j + 1]++; } sa2.insert(x); } } } int ma[5], v[5]; inc(j, 5) { ma[j] = 0; } FOR(it, sa2) { inc(j, 5) { v[j] = (j == 0 ? 0 : v[j - 1]) + (*it)[j + 1] * (j + 1); setmax(ma[j], v[j]); } } sa.clear(); FOR(it, sa2) { inc(j, 5) { v[j] = (j == 0 ? 0 : v[j - 1]) + (*it)[j + 1] * (j + 1); if(v[j] == ma[j]) { sa.insert(*it); break; } } } sa2.clear(); } int ans = 0; FOR(it, sa) { setmax(ans, (*it)[5]); } cout << ans << endl; return 0; }