#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")


#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
string con="con";
int main(){
  ll n;cin >> n;
  string s;cin >> s;
  vvl dp(3,vl(4));
  rep(i,n*3){
    ll p=3;
    rep(j,3)if(s[i]==con[j])p=((j-i)%3+3)%3;
    dp[i%3][p]++;
  }
  ll ans=0;
  ll ret=0;
  rep(i,3){
    ll p=min({dp[0][i],dp[1][i],dp[2][i]});
    if(i&&p)ret++;
    ans+=min({dp[0][i],dp[1][i],dp[2][i]});
  }
  if(ans==n&&ret)ans--;
  cout << ans << endl;

}