#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}


signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n; cin >> n;
  string s; cin >> s;
  s = ' ' + s + ' ';

  vector<int> preS(n + 2, -1), preP(n + 2, -1);
  for(int i = 1; i <= n; i++)
    preS[i] = (s[i] == 's' ? i : preS[i - 1]), preP[i] = (s[i] == 'p' ? i : preP[i - 1]);
  vector<int> sufS(n + 2, -1), sufU(n + 2, -1);
  for(int i = n; i > 0; i--)
    sufS[i] = (s[i] == 's' ? i : sufS[i + 1]), sufU[i] = (s[i] == 'u' ? i : sufU[i + 1]);

  int ans = LLONG_MAX;
  for(int i = 1; i <= n; i++)
    if (s[i] == 'b' and preP[i] != -1 and preS[preP[i]] != -1 and sufS[i] != -1 and sufU[sufS[i]] != -1)
      ans = min(ans, (i - preP[i] - 1) + (i - preS[preP[i]] - 2) + (sufS[i] - i - 1) + (sufU[sufS[i]] - i - 2));

  cout << ans << '\n';

  return 0;
}