#include <bits/stdc++.h>
using namespace std ;
const int inf = 1e7 ;
const int MAX = 400 + 5 ;
string s ;
vector< vector< vector< vector<int> > > >dp ;
short cnt[3][MAX] , occ[3][MAX] ;
int n ;
int solve(int idx , int cnt1 , int cnt2 , int cnt3 , int prv)
{
if(idx == n)
return 0 ;
int &ret = dp[cnt1][cnt2][cnt3][prv] ;
if(ret != -1)
return ret ;
ret = inf ;
for(int i = 0 ; i <= 2 ; ++i)
{
if(i == prv && idx != 0)
continue ;
int to = -1 ;
if(i == 0)
to = occ[0][cnt1] ;
if(i == 1)
to = occ[1][cnt2] ;
if(i == 2)
to = occ[2][cnt3] ;
if(to == -1)
continue ;
int cost = max(0 , cnt[0][to] - cnt1) + max(0 , cnt[1][to] - cnt2) + max(0 , cnt[2][to] - cnt3) ;
if(i == 0)
ret = min(ret , solve(idx+1 , cnt1+1 , cnt2 , cnt3 , i) + cost) ;
if(i == 1)
ret = min(ret , solve(idx+1 , cnt1 , cnt2+1 , cnt3 , i) + cost) ;
if(i == 2)
ret = min(ret , solve(idx+1 , cnt1 , cnt2 , cnt3+1 , i) + cost) ;
}
return ret ;
}
int main()
{
memset(occ , -1 , sizeof(occ)) ;
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
cin>>s ;
int cnt1 = 0 , cnt2 = 0 , cnt3 = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cnt[0][i] = cnt1 , cnt[1][i] = cnt2 , cnt[2][i] = cnt3 ;
if(s[i] == 'R')
occ[0][cnt1++] = i ;
else if(s[i] == 'G')
occ[1][cnt2++] = i ;
else
occ[2][cnt3++] = i ;
}
dp = vector<vector<vector<vector<int>>>>(cnt1+1, vector<vector<vector<int>>>(cnt2+1, vector<vector<int>>(cnt3+1, vector<int>(3,-1)))) ;
int ans = solve(0 , 0 , 0 , 0 , 0) ;
if(ans >= inf)
ans = -1 ;
//testing to see if the answer will fit in short data type
assert(ans <= 32767) ;
return cout<<ans<<"\n" , 0 ;
}
