#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) range(i,0,b)
#define rangei(i,a,b) for(ll a=a;i<=ll(b);i++)
#define repi(i,b) rangei(i,1,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator << (ostream &os, vector<T> const &);
template<int n, class...T>
typename enable_if<(n>=sizeof...(T))>::type
_ot(ostream &, tuple<T...> const &){}
template<int n, class...T>
typename enable_if<(n< sizeof...(T))>::type
_ot(ostream &os, tuple<T...> const &t){
    os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t);
}
template<class...T>
ostream & operator << (ostream &os, tuple<T...> const &t){
    _ot<0>(os, t); return os;
}
template<class T, class U>
ostream & operator<<(ostream &os, pair<T,U> const &p){
    return os << "(" << p.first << ", " << p.second << ") ";
}
template<class T>
ostream & operator<<(ostream &os, vector<T> const &v){
    rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os;
}
#ifdef DEBUG
#define dump(...) (cerr << #__VA_ARGS__ << " = " << mt(__VA_ARGS__) \
                   << " [" << __LINE__ << "]" << endl)
#else
#define dump(...)
#endif
void fastios(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // #define endl '\n'
}
template<class T>
size_t uniq(vector<T> &v){
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v.size();
}
template<class T>
size_t uniq(T *l, size_t n){
    sort(l,l+n);
    return unique(l,l+n) - l;
}
#define mems(arr,val) memset(arr,val,sizeof(arr));
int const inf = numeric_limits<int>::max()/8;

int dp[30][30][30][30][30];
int n;
string s;

int rec(int k, int u, int r, int o, int i, int pos){
    int & res = dp[k][u][r][o][i];
    char c = s[pos];
    if(res != -1) return res;
    if(pos == n) return res = 0;
    // res = 0;
    if((c == 'k' || (c == '?')) && k != 0){
        res = max(res, rec(k-1,u+1,r,o,i,pos+1));
    }
    if((c == 'u' || (c == '?')) && u != 0){
        res = max(res, rec(k,u-1,r+1,o,i,pos+1));
    }
    if((c == 'r' || (c == '?')) && r != 0){
        res = max(res, rec(k,u,r-1,o+1,i,pos+1));
    }
    if((c == 'o' || (c == '?')) && o != 0){
        res = max(res, rec(k,u,r,o-1,i+1,pos+1));
    }
    if((c == 'i' || (c == '?')) && i != 0){
        res = max(res, rec(k,u,r,o,i-1,pos+1) + 1);
    } 
    res = max(res, rec(k,u,r,o,i,pos+1));
    dump(k,u,r,o,i,pos, res);
    return res;
}

int solve(){
    n = s.size();
    memset(dp,-1,sizeof(dp));
    for(char &c : s) c = tolower(c);
    int ans = rec(s.size()/5+1,0,0,0,0,0);
    int *b = (int*)dp;
    int *e = b + sizeof(dp) / sizeof(int);
    ans = max(ans, *max_element(b,e));
    return ans;
}

int main(){
    while(cin >> s && s != "~") cout << solve() << endl;
}