#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int n;
string s;
int c[26];
int main()
{
    cin>>n;
    cin>>s;
    for(int i=0; i<n; i++) c[s[i]-'a']++;
    int ans=c[25];
    int cnt[8]={};
    for(int i=0; i<25; i++){
        if(i==24) cnt[0]=c[i];
        else if(i>'u'-'a') cnt[1]+=c[i];
        else if(i=='u'-'a') cnt[2]=c[i];
        else if(i>'k'-'a') cnt[3]+=c[i];
        else if(i=='k'-'a') cnt[4]=c[i];
        else if(i>'i'-'a') cnt[5]+=c[i];
        else if(i=='i'-'a') cnt[6]=c[i];
        else cnt[7]+=c[i];
    }
    int x1=0, x2=cnt[0]+1;
    while(x2-x1>1){
        int x=(x1+x2)/2;
        int cnt1[8];
        for(int i=0; i<8; i++) cnt1[i]=cnt[i];
        int mada=x;
        cnt1[0]-=min(mada, cnt1[0]);
        cnt1[1]+=cnt1[0];
        mada-=min(mada, cnt1[1]);
        if(mada>cnt1[2]){
            x2=x;
            continue;
        }
        cnt1[2]-=mada;
        cnt1[3]+=cnt1[2];
        mada-=min(mada, cnt1[3]);
        if(mada>cnt1[4]){
            x2=x;
            continue;
        }
        cnt1[4]-=mada;
        cnt1[5]+=cnt1[4];
        mada-=min(mada, cnt1[5]);
        if(mada>cnt1[6]){
            x2=x;
            continue;
        }
        cnt1[6]-=mada;
        cnt1[7]+=cnt1[6];
        mada-=min(mada, cnt1[7]);
        if(mada>0) x2=x;
        else x1=x;
    }
    ans+=x1;
    cout<<ans<<endl;
    return 0;
}