#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<bitset>
#include<array>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<numeric>
#define D int
#define U unsigned
using namespace std;
D n, m,a, b, d, e;
D i, j, k;
char c,f;
string s;
D ans;
char ta[] = { 'K','U','R','O','I' };
int main() {
	D t;
	vector<int> kuroi;
	auto it = kuroi.begin();
	cin >> s;
	for (auto x : s) {
		if (x == ta[0]) {
			kuroi.push_back(1);
		}
		if (x == '?') {
			sort(kuroi.begin(), kuroi.end());
			reverse(kuroi.begin(), kuroi.end());
			if (!kuroi.empty()) {
				kuroi[0]++;
				if (kuroi[0] == 5) {
					ans++;
					kuroi.erase(kuroi.begin());
				}
			}
			else {
				kuroi.push_back(1);
			}
		}
		for (it = kuroi.begin(); it != kuroi.end(); it++) {
			if (ta[*it]==x) {
				(*it)++;
				if (*it == 5) {
					ans++;
					kuroi.erase(it);
				}
				break;
			}
		}
	}
	cout << ans << endl;
}