#include <iostream>
#include <algorithm>
using namespace std;
int dta[9];// z y x~v u t~l k j i h~a
int main(){
  char yuki[4] = {'y','u','k','i'};
  int n;cin>>n;
  string s;cin>>s;
  for(int i = 0; s.size() > i; i++){
    int ok = false;
    for(int j = 0; 8 > j; j+=2){
      if(s[i] > yuki[j/2]){
        ok = true;
        dta[j]++;
        break;
      }else if(s[i] == yuki[j/2]){
        ok = true;
        dta[j+1]++;
        break;
      }
    }
    if(!ok){
      dta[8]++;
    }
  }
  reverse(dta,dta+9);
  int tans = (dta[1]>dta[0]?dta[0]+(dta[1]-dta[0])/2:dta[1]);
  for(int i = 2;  9 > i; i+=2){
    int ans = min(dta[i],dta[i+1]);
    //cout << i << " " << i+1 << ":" << dta[i] << " " << dta[i+1] << endl;
    if(dta[i+1] > dta[i]){
      dta[i+1] -= dta[i];
      ans += min(dta[i+1],tans);
      if(dta[i+1] > tans){
        dta[i+1]-= tans;
        ans += dta[i+1]/=2;
      }
    }
    tans = ans;
  }
  cout << tans + dta[8] << endl;

}