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

#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, n) FOR(i, 0, n)
#define FORR(i, l, r) for(ll i = r - 1; i >= l; i--)
#define ALL(ar) begin(ar), end(ar)

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
    return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
    return a > b && (a = b, true);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    os << p.first << ' ' << p.second;
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for(T &x : v) is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); i++) os << (i ? " " : "") << v[i];
    return os;
}
//-------------------------------------------------

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;

    vector<int> mx(n + 1, 0);
    rep(i, n) {
        if(i + 5 <= n && s.substr(i, 5) == "CPCTF") {
            chmax(mx[i + 5], mx[i] + 1);
        } else if(i + 7 <= n && s.substr(i, 7) == "CPCTCPC") {
            chmax(mx[i + 7], mx[i] + 1);
        }
        chmax(mx[i + 1], mx[i]);
    }

    cout << mx[n] << endl;
}

int main() {
    int t = 1;
    // cin >> t;
    while(t--) solve();
}