#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define deb(a,b,c) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
 
typedef long long int ll;
typedef string str;
 
ll power(ll x, ll y, ll p) 
{ 
    ll res = 1;     
  
    x = x % p;   
    while (y) 
    { 
        if (y & 1) 
            res = (res*x) % p; 
        y = y>>1;  
        x = (x*x) % p; 
    } 
    return res; 
} 
 
ll nCrModP(ll n, ll r, ll p) 
{ 
    if (!r) 
      return 1; 
  
	ll fac[n+1]; 
   	fac[0] = 1; 
    for (ll i=1 ; i<=n; i++) 
        fac[i] = fac[i-1]*i%p; 
  
    return (fac[n]* power(fac[r], p-2,p) % p * power(fac[n-r], p-2,p) % p) % p; 
}
 
ll gcd(ll a, ll b){ 
    if (a == 0) 
        return b;  
    return gcd(b % a, a);
}
 
void fast(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main ()
{
	
	ll t,n,m,k,i,j,a,b;
	// cin >> t;
    str st,s;
    cin >> n >> k;
    while(k>0)
    {
        if(n%200==0)
        {
            n/=200;
        }
        else
        {
            n*=1000;
            n+=200;
        }
        k--;
    }
    cout << n << "\n";
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
const ll INF=1e9;
const ll mod=1e9+7;

int main() {
  int N;
  string s;
  cin >> N >> s;
  
  stack<int> ss, res;
  int m=0;
  int i=0;
  while (i<N) {
    if (i+2<N && s[i]=='f' && s[i+1]=='o' && s[i+2]=='x') {
      m++;
      i+=3;
    }
    
    else if (i+1<N && s[i]=='f' && s[i+1]=='o') {
      ss.push(2);
      i+=2;
    }
    
    else if (i<N && s[i]=='f') {
      ss.push(1);
      i++;
    }
    
    else if (ss.size()>0 && i<N && s[i]=='x') {
      int sss=ss.top();
      if (sss==2) {
        m++;
        i++;
        ss.pop();
      }
      else {
        ss=res;
      }
    }
    
    else if (ss.size()>0 && i+1<N && s[i]=='o' && s[i+1]=='x') {
      int sss=ss.top();
      if (sss==1) {
        m++;
        i+=2;
        ss.pop();
      }
      else {
        ss=res;
      }
    }
    else if (ss.size()>0 && i<N && s[i]=='o') {
      int sss=ss.top();
      if (sss==1) {
        ss.pop();
        ss.push(2);
        i++;
      }
      else {
        ss=res;
      }
    }
    else {
      ss=res;
      i++;
    }
  }
  cout << N-3*m << endl;
}
