#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()

int N,T;
string S;
signed main()
{
    cin >> S;
    string t = "";
    vector<char> KUROI;
    KUROI.push_back('K');
    KUROI.push_back('U');
    KUROI.push_back('R');
    KUROI.push_back('O');
    KUROI.push_back('I');
    for (auto&& s : S) {
        if (CONTAIN(KUROI, s) || s == '?') {
            t.push_back(s);
        }
    }
    int i = 0;
    int j = 0;
    int cnt = 0;
    vector<int> ps;
    while(i < t.size()) {
        char c = t[i];
        if (c == KUROI[j]) {
            j++;
            ps.push_back(i);
            if (j == KUROI.size()) {
                cnt++;
                RREP(k,ps.size()) {
                    t.erase(ps[k], 1);
                }
                i = j = 0;
                ps = vector<int>();
                continue;
            }
        }
        i++;
    }
    int qp = 1000;
    i = j = 0;
    ps = vector<int>();
    while (i < t.size()) {
        char c = t[i];
        if (c == KUROI[j]) {
            j++;
            ps.push_back(i);
        }
        if (c == '?') qp = min(i, qp);
        i++;
        if (j < KUROI.size() && i == t.size()) {
            if (qp < t.size()) {
                ps.push_back(qp);
                j++;
                i = qp + 1;
                qp = 10000;
            }
        }
        if (j == KUROI.size()) {
            cnt++;
            RREP(k,ps.size()) {
                t.erase(ps[k], 1);
            }
            i = j = 0;
            ps = vector<int>();
        }
    }
    cout << cnt << endl;

    return 0;
}