#include "bits/stdc++.h"
#include <chrono>

using namespace std;
using namespace std::chrono;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define forn(ii,nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade,bde) __gcd(ade,bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define vc vector<char>
#define pb(ade) push_back(ade)
#define pp pop_back()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define type(ade) typeid(ade).name();
#define starting() auto start = high_resolution_clock::now()
#define ending() auto stop = high_resolution_clock::now();\
auto duration = duration_cast<microseconds>(stop - start);\
cerr << "\n" << "\n" << "Execution Time : "<< duration.count()/1000 << " ms" << "\n"

template <typename T1>
void print(vector<T1> arr) {
	int l = (int)arr.size();
	cerr << "[" ;
	for(int i = 0; i < l; i++) {
		(i == l - 1) ? cerr << arr[i] : cerr << arr[i] << "," ;
	}
	cerr << "]" << "\n";
}

template <typename T1>
void printArr(int arr[], int l) {
	cerr << "[" ;
	for (int i = 0; i < (int)l; i++) {
		(i == l-1) ? cerr << arr[i] : cerr << arr[i] << "," ;
	}
	cerr << "]" << "\n";
}

template <typename T1>
void console(vector<vector<T1>> arr) {
	for (int i = 0; i < (int)arr.size(); ++i) {
		cerr << "\n" << " [" ;
	    for(int j = 0; j < (int)arr[i].size(); ++j) {
			(j == (int)arr[i].size() - 1) ? cerr << arr[i][j] : cerr << arr[i][j] << "," ;
		}
	    cerr << "]";
	}
	cerr << "\n";
}
template <typename T1,typename T2>
void mapped(map<T1,T2> m) {
	for(auto ite = m.begin(); ite != m.end(); ++ite){
		cerr << "'" << ite->first << "'"<< " : " << ite->second << "\n";
	}
}

template <typename T1 , typename T2>
void mappedArr(map<T1,vector<T2>> m) {
	for (auto ity = m.begin(); ity != m.end(); ++ity) {
		cerr << "'" << ity->first << "'" << " : " << "[";
        for (int i = 0; i < (int)ity->second.size(); ++i) {
			(i == (int)ity->second.size() - 1) ? cerr << ity->second[i] : cerr << ity->second[i] << ",";
		}
		cerr << "]"<< "\n";
	}
}

string int_to_string(int x) {
    stringstream ss;
	ss << x;
	string ni = ss.str();
	return ni;
}
int char_to_int(char c) {
	int n = (int)c - 48;
	return n;
}
int string_to_int(string x) {
	int n;
	stringstream s(x);
	s >> n;
	return n;
}

template <typename T1, typename T2>
void vectPair(vector<pair<T1,T2>> vp) {
	for (int arrp = 0; arrp< (int)vp.size(); ++arrp){
		cerr << "(" << vp[arrp].first << "," << vp[arrp].second << ")" << "\n" ;
	}
}

//unordered_map<int,int> um;
//unordered_set<int> us;
//set<int> s;
// v.front() gives the first element of vector
// v.back()  gives the last element of vector
// insert erase substr
//g++ -o Legendary-Grandmaster Legendary-Grandmaster.cpp&Legendary-Grandmaster.exe
//cd C:\Users\158si\Desktop\Algorithim\codeForces\elite
// for-bash cd C:/Users/158si/Desktop/Algorithim/codeForces/elite
//memset(arr,element,sizeofarray);//Converts the value ch to unsigned char and copies it
// into each of the first n characters of the object pointed to by str[].
//g++ -o impulse.exe impulse.cpp
//puts
typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = 1e18L + 5;

/**************************/

int main() {
	IOS;
	//#ifndef ONLINE_JUDGE
	//freopen("input.txt", "r", stdin);
	//freopen("ouput.txt", "w", stdout);
	//#endif
	ll n;
	cin >> n;   
	string s;
	cin >> s;
	vector<ll> r(n + 1);
	vector<ll> g(n + 1);
	vector<ll> b(n + 1);
	for (int i = n - 1; i >= 0; --i) {
		if (s[i] == 'R')  {
			r[i] = 1 + r[i + 1];
			g[i] = g[i + 1];
			b[i] = b[i + 1];  
		}
		if (s[i] == 'G')  {
			r[i] = r[i + 1];
			g[i] = g[i + 1] + 1;
			b[i] = b[i + 1];  
		}
		if (s[i] == 'B')  {
			r[i] = r[i + 1];
			g[i] = g[i + 1];
			b[i] = b[i + 1] + 1;  
		}

	}
	ll cnt = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = i + 1; j < n; ++j) {
			if (s[j] != s[i]) {
				if ( (s[i] == 'R' && s[j] == 'B' )|| (s[i] == 'B' && s[j] == 'R' ) ) {
					cnt += g[j + 1];// j + j - i == k
					if (2*j - i < n && s[2*j - i] == 'G') {
						cnt--;
					}
				}
				if ( (s[i] == 'R' && s[j] == 'G' )|| (s[i] == 'G' && s[j] == 'R' ) ) {
					cnt += b[j + 1];// j + j - i == k
					if (2*j - i < n && s[2*j - i] == 'B') {
						cnt--;
					}
				}
				if ( (s[i] == 'G' && s[j] == 'B' )|| (s[i] == 'B' && s[j] == 'G' ) ) {
					cnt += r[j + 1];// j + j - i == k
					if (2*j - i < n && s[2*j - i] == 'R') {
						cnt--;
					}
				}
			}
		}
	}
	cout << cnt << endl;
	return 0;
}


Measured memory_bytes: 3732