#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define INF 100000000
//#define int long long
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define mid(l, u) ((l+u)/2)
#define x(p) p.first
#define y(p) p.second
#define MOD 998244353
#define ordered_set tree<pair<int, int>, null_type,less<pair<int, int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
int n;
const int N = 405;
int dp[N][N][N][4];
int arr[N];
int g[3][N];
int cc[] = {0, 0, 0};
int cmp[N][3];
int getans(int i, int aused, int bused, int prev){
int cnt[] = {aused, bused, i - (aused + bused)};
int tr = INF;
for(int j = 0;j<3;j++){
if(j==prev || cc[j] <= cnt[j]) continue;
int currind = g[j][cnt[j]];
for(int k = 0;k<3;k++){
if(k==j) continue;
currind += max((int)0, cnt[k] - cmp[g[j][cnt[j]]][k]);
//cout<<"equivalent at index "<<g[j][cnt[j]]<<" for type "<<k<<" is "<<cmp[g[j][cnt[j]]][k]<<endl;
}
cnt[j]++;
//cout<<"putting "<<j<<", cost is "<<(currind - (i+1))<<endl;
tr = min(tr, (currind - (i+1)) + ((i==(n-1))?0:dp[i+1][cnt[0]][cnt[1]][j]));
cnt[j]--;
}
return tr;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
string s;
cin>>s;
for(int i = 1;i<=n;i++){
if(s[i-1]=='R') arr[i] = 0;
else if(s[i-1]=='G') arr[i] = 1;
else arr[i] = 2;
cmp[i][0] = cc[0];
cmp[i][1] = cc[1];
cmp[i][2] = cc[2];
g[arr[i]][cc[arr[i]]++] = i;
}
for(int i = 0;i<=n;i++) for(int j = 0;j<=n;j++) for(int k = 0;k<=n;k++) for(int x = 0;x<3;x++) dp[i][j][k][x] = INF;
for(int i = n-1;i>=1;i--){
for(int aused = n;aused>=0;aused--){
for(int bused = n;bused >= 0 ;bused--){
int cused = i - (aused + bused);
int ause = INF, buse = INF, cuse = INF;
if(aused>cc[0] || bused>cc[1] || cused>cc[2]) continue;
if(cused<0) continue;
int currind;
//calculate use[0]
if(cc[0] > aused) {
currind = g[0][aused] + max((int) 0, bused - cmp[g[0][aused]][1]) +
max((int) 0, cused - cmp[g[0][aused]][2]);
ause = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused + 1][bused][0]);
}
//calculate buse
if(cc[1] > bused) {
currind = g[1][bused] + max((int) 0, aused - cmp[g[1][bused]][0]) +
max((int) 0, cused - cmp[g[1][bused]][2]);
buse = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused][bused + 1][1]);
}
//calculate cuse
if(cc[2] > cused) {
currind = g[2][cused] + max((int) 0, aused - cmp[g[2][cused]][0]) +
max((int) 0, bused - cmp[g[2][cused]][1]);
cuse = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused][bused][2]);
}
dp[i][aused][bused][0] = min(buse, cuse);
dp[i][aused][bused][1] = min(ause, cuse);
dp[i][aused][bused][2] = min(buse, ause);
}
}
}
int ans = getans(0, 0, 0, 4);
if(ans>=INF) ans = -1;
cout<<ans<<"\n";
}
//2^(2k - 1) - 2^(k-1)
/*
4 4
RGWR
GRRG
WGGW
WWWR
5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW
20
YYGYYYGGGGRGYYGRGRYG
*/
