#include <bits/stdc++.h>
#define ll long long int
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end() 
#define max_pqueue priority_queue< long long >
#define min_pqueue priority_queue< long long , vector<long long> , greater< long long >>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define FF first
#define SS second

//~ setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//~ setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//~ setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//~ cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

#ifndef LOCAL_MACHINE
#define cerr if (false) cerr
#endif

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
template<typename T>
void _printA(T *t, long long sz) { cout<<" { "; for (long long i=0; i<sz; i++) cout<<"["<<i<<"] = "<< t[i]<<endl; cout<<" } \n";}
#ifdef LOCAL_MACHINE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define debugA(x, y) cerr << "[" << #x << "] = "; _printA(x, y)
#else
#define debug(x...)
#define debugA(x, y)
#endif

const ll _MOD = (ll)1e9 + 7;

ll mod(ll a, ll m=_MOD) {
	return (a + m) % m;
}

ll gcd(ll a, ll b) { return __gcd(a, b); }

ll gcd(ll a, ll b, ll & x, ll & y) {
    if (a == 0) {
        x = 0;
        y = 1;
        return b;
    }
    ll x1, y1;
    ll d = gcd(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return d;
}

ll modinv(ll a, ll m=_MOD) {
	ll x, y;
	gcd(a, m, x, y);
	x = (x % m + m) % m;
    return x;
}

ll powm(ll a, ll b, ll m=_MOD) {
	if (b==0)
		return 1;
	ll ans = powm(a, b/2, m) % m;
	ans = (ans * ans) % m;
	return (b & 1) ? (ans * (a%m)) % m : ans;
}

/* ------------------------------------------------------------------ */

ll preR[4005], preG[4005], preB[4005];
ll sufR[4005], sufG[4005], sufB[4005];
void solve() {
	int N;
	cin>>N;
	string S;
	cin>>S;
	fill(preR, preR + N, 0);
	fill(preG, preG + N, 0);
	fill(preB, preB + N, 0);
	fill(sufR, sufR + N, 0);
	fill(sufG, sufG + N, 0);
	fill(sufB, sufB + N, 0);
	for (int i=0; i<N; i++) {
		if (i>0) {
			preR[i] = preR[i-1];
			preG[i] = preG[i-1];
			preB[i] = preB[i-1];
		}
		if (S[i] == 'R') preR[i]++;
		if (S[i] == 'G') preG[i]++;
		if (S[i] == 'B') preB[i]++;
	}
	
	for (int i=N-1; i>=0; i--) {
		if (i<N-1) {
			sufR[i] = sufR[i+1];
			sufG[i] = sufG[i+1];
			sufB[i] = sufB[i+1];
		}
		if (S[i] == 'R') sufR[i]++;
		if (S[i] == 'G') sufG[i]++;
		if (S[i] == 'B') sufB[i]++;
	}
	
	ll sum = 0;
	for (int i=0; i<N; i++) {
		if (S[i] == 'R') {
			sum += preG[i]*sufB[i] + preB[i]*sufG[i];
		}
		if (S[i] == 'G') {
			sum += preR[i]*sufB[i] + preB[i]*sufR[i];
		}
		if (S[i] == 'B') {
			sum += preG[i]*sufR[i] + preR[i]*sufG[i];
		}
		
		int len = min(i - 0, N-1 - i); 
		for (int j=1; j<=len; j++) {
			if (S[i] == 'R') {
				if (S[i-j]=='G' and S[i+j]=='B') sum--;
				if (S[i-j]=='B' and S[i+j]=='G') sum--;
			}
			if (S[i] == 'G') {
				if (S[i-j]=='R' and S[i+j]=='B') sum--;
				if (S[i-j]=='B' and S[i+j]=='R') sum--;
			}
			if (S[i] == 'B') {
				if (S[i-j]=='G' and S[i+j]=='R') sum--;
				if (S[i-j]=='R' and S[i+j]=='G') sum--;
			}
		} 
	}
	
	cout<<sum<<endl;
}

int main() {
#ifdef LOCAL_MACHINE
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-result"
freopen("in", "r", stdin);
#pragma GCC diagnostic pop
#endif
	
	fast_io;
	ll T;
	T = 1;
	//~ cin>>T;
	for (ll t=0; t<T; t++) {
		solve();
	}
}	











Measured memory_bytes: 3820