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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
string S;

int dp[101010];
int pre[3]={-1,-1,-1};
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>S;
	string T;
	FORR(c,S) {
		if(c=='R') c=0;
		if(c=='G') c=1;
		if(c=='B') c=2;
		if(T.empty()||T.back()!=c) T+=c;
	}
	N=T.size();
	FOR(i,N) {
		dp[i+1]=dp[i]+1;
		if(pre[T[i]]!=-1) {
			x=i-pre[T[i]]-1;
			dp[i+1]=min(dp[i+1],dp[pre[T[i]]+1]+(x+2)/2);
		}
		pre[T[i]]=i;
	}
	cout<<dp[N]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}