#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    string s; cin >> s;
    int res = 0;
    string t = "con";
    for(int i=0;i<3;i++){
        vector<int> v(3);
        for(int j=0;j<3*n;j++){
            if(t[(i+j)%3] == s[j]){
                v[(i+j)%3]++;
            }
        }
        res += min({v[0],v[1],v[2]});
    }
    if(n == res){
        bool ok = true;
        for(int i=0;i<3*n;i+=3) if(s[i] != 'c') ok = false;
        if(!ok) res--;
    }
    cout << res << endl;
}