#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
//#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline void sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline void BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = 2;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

class CumulativeSum {
	const ll size;
	std::vector<ll> sumList;
public:

	CumulativeSum() = delete;
	CumulativeSum(const std::vector<ll>& v) :size(v.size()), sumList(size + 1) {
		for (ll i = 0; i < size; ++i) {
			sumList[i + 1] = sumList[i] + v[i];
		}
	}
	ll get(ll n) {
		return sumList[n + 1];
	}
	ll get(ll l, ll r) {
		if (r < l) { return 0LL; }
		l = std::max(l, 0LL); r = std::min(r, size - 1);
		return sumList[r + 1] - sumList[l];
	}
};


signed main() {
	ll n;
	cin >> n;
	string s;
	cin >> s;

	VL r(n), g(n), b(n);
	REP(i, n) {
		if (s[i] == 'R') { ++r[i]; }
		if (s[i] == 'G') { ++g[i]; }
		if (s[i] == 'B') { ++b[i]; }
	}
	auto R = CumulativeSum(r);
	auto G = CumulativeSum(g);
	auto B = CumulativeSum(b);

	auto ad = [](VL& v, char c) {
		if (c == 'R') { ++v[0]; }
		if (c == 'G') { ++v[1]; }
		if (c == 'B') { ++v[2]; }
	};
	dump(r, g, b);

	ll ans = 0;
	FOR(i, 1, n)FOR(j, i + 1, n) {
		if (s[i] == s[j]) { continue; }
		ll val = 0;

		VL v(3);
		ad(v, s[i]);
		ad(v, s[j]);
		if (v[0] == 0) { val += R.get(i - 1); }
		if (v[1] == 0) { val += G.get(i - 1); }
		if (v[2] == 0) { val += B.get(i - 1); }

		ll dif = j - i;
		if (i - dif >= 0) {
			if (v[0] == 0) if (s[i - dif] == 'R') { --val; }
			if (v[1] == 0) if (s[i - dif] == 'G') { --val; }
			if (v[2] == 0) if (s[i - dif] == 'B') { --val; }
		}
		dump(val);
		ans += val;
	}
	cout << ans << endl;

}




Measured memory_bytes: 3812