#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
int main(){
  int N;
  cin >> N;
  string S;
  cin >> S;
  string T = "con";
  vector<vector<int>> cnt(3, vector<int>(3, 0));
  for (int i = 0; i < N * 3; i++){
    for (int j = 0; j < 3; j++){
      if (S[i] == T[j]){
        int x = (i - j + 3) % 3;
        cnt[x][j]++;
      }
    }
  }
  vector<int> cnt2(3, INF);
  for (int i = 0; i < 3; i++){
    for (int j = 0; j < 3; j++){
      cnt2[i] = min(cnt2[i], cnt[i][j]);
    }
  }
  int sum = cnt2[0] + cnt2[1] + cnt2[2];
  if (sum < N){
    cout << sum << endl;
  } else if (cnt2[0] == N){
    cout << N << endl;
  } else {
    cout << N - 1 << endl;
  }
}