978B - File Name - CodeForces Solution

#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int ans = 0;
  int now = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == 'x') {
      if (now == 2) {
        ans++;
      } else {
        now++;
      }
    } else {
      now = 0;
    }
  }
  cout << ans << endl;

  return 0;
}