#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(n) rep(i,n)
typedef long long ll;
using namespace std;


signed main()
{
	string S;
	queue<int> K;
	queue<int> U;
	queue<int> R;
	queue<int> O;
	queue<int> I;
	queue<int> Q;	//?
	
	cin >> S;
	for (int i=0; i<S.length(); i++)
	{
		switch (S[i])
		{
		case 'K':
			K.push(i);
			break;
		case 'U':
			U.push(i);
			break;
		case 'R':
			R.push(i);
			break;
		case 'O':
			O.push(i);
			break;
		case 'I':
			I.push(i);
			break;
		case '?':
			Q.push(i);
			break;
		}
	}
	
	bool exit = false;
	int ans = 0;
	while (1)
	{
		int k, u, r, o, i;
		if (K.empty())
		{
			if (Q.empty()) exit = true;
			else Q.pop();
		} else {
			k = K.front();
			if (U.empty())
			{
				if (Q.empty()) exit = true;
				else Q.pop();
			}
			u = U.front();
			K.pop();
			if (k < u)
			{
				if (R.empty())
				{
					if (Q.empty()) exit = true;
					else Q.pop();
				} else {
					r = R.front();
					if (O.empty())
					{
						if (Q.empty()) exit = true;
						else Q.pop();
					}
					o = O.front();
					R.pop();
					if (u < r)
					{
						if (O.empty())
						{
							if (Q.empty()) exit = true;
							else Q.pop();
						} else {
							o = O.front();
							if (I.empty())
							{
								if (Q.empty()) exit =true;
								else Q.pop();
							}
							i = I.front();
							O.pop();
							if (r < o)
							{
								if (I.empty())
								{
									if (Q.empty()) exit = true;
									else Q.pop();
								} else {
									i = I.front();
									if (o < i) ans++;
									I.pop();
								}
							}
						}
					}
				}
			}
		}
		
		if (exit) break;
	}
	
	cout << ans << endl;
	
	return 0;
}