#include <iostream>
using namespace std;
const long T1 = 101;
const long T2 = 101L * 101;
const long T3 = 101L * 101 * 101;
const long T4 = 101L * 101 * 101 * 101;
string s;

long next(long KUROI, char c) {
  int k = KUROI % 101;
  int u = KUROI / T1 % 101;
  int r = KUROI / T2 % 101;
  int o = KUROI / T3 % 101;
  int i = KUROI / T4 % 101;
  if(c == 'K') {
    k++;
  } else if(c == 'U') {
    u = min(u + 1, k);
  } else if(c == 'R') {
    r = min(r + 1, u);
  } else if(c == 'O') {
    o = min(o + 1, r);
  } else if(c == 'I') {
    i = min(i + 1, o);
  }
  return k + u * T1 + r * T2 + o * T3 + i * T4;
}
long solve(int k, long KUROI, int cur) {
  long answer = 0;
  if(k == s.size()) {
    return KUROI / T4 % 101;
  }
  switch(s[k]) {
    case 'K':
    case 'U':
    case 'R':
    case 'O':
    case 'I':
      return solve(k + 1, next(KUROI, s[k]), cur);
    case '?':
      for(int j = cur; j < 5; j++) {
        answer = max(answer, solve(k + 1, next(KUROI, "KUROI"[j]), j));
      }
      return answer;
    default:
      return solve(k + 1, KUROI, cur);
  }
}
int main() {
  cin >> s;
  cout << solve(0, 0, 0) << endl;
}