#include <iostream>
#include <vector>
using namespace std;

int dp[101][22][22][22][22];

main() {
    string s;
    cin>>s;
    int ans=1;
    dp[0][0][0][0][0]=1;
    for (int i=0;i<s.size();++i) {
        for (int K=0;K<=20;++K) {
            for (int U=0;U<=K;++U) {
                for (int R=0;R<=U;++R) {
                    for (int O=0;O<=R;++O) {
                        if (dp[i][K][U][R][O]!=0) {
                            char c=s[i];
                            if (c=='K' || c=='?')
                                dp[i+1][K+1][U][R][O]=max(dp[i+1][K+1][U][R][O],dp[i][K][U][R][O]);
                            if (c=='U' || c=='?') 
                                dp[i+1][K][U+1][R][O]=max(dp[i+1][K][U+1][R][O],dp[i][K][U][R][O]);
                            if (c=='R' || c=='?')
                                dp[i+1][K][U][R+1][O]=max(dp[i+1][K][U][R+1][O],dp[i][K][U][R][O]);
                            if (c=='O' || c=='?')
                                dp[i+1][K][U][R][O+1]=max(dp[i+1][K][U][R][O+1],dp[i][K][U][R][O]);
                            if (c=='I' || c=='?') if (O>dp[i][K][U][R][O]-1) {
                                dp[i+1][K][U][R][O]=max(dp[i+1][K][U][R][O],dp[i][K][U][R][O]+1);
                                ans=max(ans,dp[i+1][K][U][R][O]);
                            }
                            dp[i+1][K][U][R][O]=max(dp[i+1][K][U][R][O],dp[i][K][U][R][O]);
                        }
                    }
                }
            }
        }
    }
    cout<<ans-1<<endl;
}