#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  string S;
  cin >> N;
  cin >> S;
  // vvl DP = VVL(N + 1, 9, 0);
  ll r = 0;
  ll g = 0;
  ll b = 0;
  ll ans = 0;
  REP(i, N) {
    if (S[i] == 'R')
      r++;
    if (S[i] == 'G')
      g++;
    if (S[i] == 'B')
      b++;
  }
  REP(i, N) REP(j, N) {
    if (i == j)
      continue;
    if (S[i] == 'R' && S[j] == 'B') {
      ll add = g;
      if (j + (j - i) <= N - 1 && S[j + (j - i)] == 'G')
        add--;
      if ((j - i) % 2 == 0 && S[i + ((j - i) / 2)] == 'G')
        add--;
      if (i - (j - i) >= 0 && S[i - (j - i)] == 'G')
        add--;
      ans += add;
    }
    /*if (S[i] == 'R' && S[j] == 'G') {
      if (j + (j - i) <= N - 1 && S[j + (j - i)] == 'B')
        ans += b - 1;
      else
        ans += b;
    }
    if (S[i] == 'G' && S[j] == 'B') {
      if (j + (j - i) <= N - 1 && S[j + (j - i)] == 'R')
        ans += r - 1;
      else
        ans += r;
    }*/
  }
  cout << ans << endl;
  /*REP(i, N) {
    ll now = 0;
    if (S[i] == 'R')
      now = 0;
    if (S[i] == 'G')
      now = 1;
    if (S[i] == 'B')
      now = 2;
    DP[i + 1] = DP[i];
    REP(j, 8) {
      if (((1 << now) & j) == 0)
        DP[i + 1][j | (1 << now)] += DP[i][j];
    }
  }
  cout << DP[3][3] << endl;*/
  return 0;
}


Measured memory_bytes: 3656