#include <bits/stdc++.h>
using namespace std;

stack<char> st;
int n;
string s;

int main() {
	ios::sync_with_stdio(0);
	cin >> n >> s;
	for(int i = 0; i < n; i++) {
		if(st.size() < 2) {
			st.push(s[i]);
			continue;
		}
		char c = st.top();
		st.pop();
		if(s[i] == 'x' && c == 'o' && st.top() == 'f') {
			st.pop();
			continue;
		}
		st.push(c), st.push(s[i]);
	}
	cout << st.size() << endl;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector <ll> vi;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define N ((ll)(4e5 + 55))
#define INF ((ll)1e18+18)
#define bismillah {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}

ll mod = 998244353;
ll M(ll x){
    if (x < 0) return (x + mod) % mod;
    return x%mod;
}
ll pw(ll x ,ll p){
    ll res = 1;
    while (p > 0){
        if (p & 1){
            res = M(x*res);
            p --;
        }
        x = M(x*x);
        p /= 2;
    }
    return M(res);
}

ll comb[N];
ll magic[N];

ll primes[N];
vector<ll> p;
void sieve(){
    
    primes[0] = primes[1] = 99;
    for (ll i = 2; i < N; i ++){
        if (primes[i] == 99) continue;
        for (ll j = i*i ; j < N; j += i){
            primes[j] = 99;
        }
    }
    for (ll i = 2; i < N; i ++){
        if (primes[i] != 99) p.pb(i);
    }
    
}

int main(){
   
    bismillah
    
    comb[0] = 1;
    for (ll i = 1; i < N; i ++){
        comb[i] = M(i * comb[i-1]);
    }
    
    sieve();
    /*for (auto pr : p){
        cout << pr << "\n";
    }*/
    ll n , m;
    cin >> n >> m;
    
    ll ans = 0;
    
    for (ll i = 1; i <= 200; i ++){
        magic[i] = M(M(M(comb[i + n - 1]) * pw(comb[i] , mod - 2)) * pw(comb[n-1] , mod - 2));
    }
    
    for (ll i = 1; i <= m; i ++){
        
        ll res = 1;
        ll c = 0;
        ll num = i;
        ll lim = num;
        while (num > 1 and p[c] * p[c] <= lim){
            ll cnt = 0;
            while (num % p[c] == 0){
                num /= p[c];
                cnt += 1;
            }
            c++;
            if (cnt == 0)continue;
            res = M(res * magic[cnt]) ;
        }
        if (num > 1){
            res = M(res * magic[1]);
        }
        ans = M(res + ans);
    }
    cout << ans;
    

}
