#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#include <cstdio>
#include <numeric>
#define ll long long
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(),(a).rend()
#define mod 1000000007
#define P pair<ll, ll>
#define V vector<ll>
#define C vector<char>
#define B vector<bool>
#define endl '\n'
using namespace std;
using graph = vector<vector<ll>>;
const ll MAX = 510000;
const ll MOD = 1000000007;

ll fac[MAX], finv[MAX], inv[MAX];


// テーブルを作る前処理
void cominit()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < MAX; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m)
{
    ll b = m, u = 1, v = 0;
    while (b)
    {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

// 二項係数計算nCk,n<=10^7,k<=10^7まで
ll com(ll n, ll k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//二項係数nCk,n<=10^9,k<=10^7まで
ll com2(ll n,ll k){
    ll res,bs=1,bb=1;
    for(ll i=0;i<k;i++){
        bs=(bs*(n-i))%mod;
        bb=(bb*(i+1))%mod;
    }
    res=modinv(bb,mod)%mod;
    res=(res*bs)%mod;
    return res;
}

// 二項係数計算nPk
ll per(ll n, ll k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[n - k] % MOD) % MOD;
}


/* ユークリッドの互除法 最大公約数*/
/*ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}*/

/*最小公倍数*/
/*
ll lcm(ll a, ll b)
{
    return a / gcd(a, b) * b;
}*/

/*二点間の距離*/
double dist(pair<double, double> a, pair<double, double> b)
{
    return sqrt(pow((a.first - b.first), 2) + pow((a.second - b.second), 2));
}

//繰り返し自乗法
double ism(double aa, ll p)
{
    double ap = aa;
    double ans = 1;
    while (p > 0)
    {
        //cout<<"p="<<p<<",ap="<<ap<<endl;
        if (p & 1)
        { //奇数が真
            ans *= ap;
        }
        p /= 2;
        ap = ap * ap;
    }
    return ans;
}
//繰り返し自乗法(アマリトリバージョン)
ll ismm(ll aa, ll p)
{
    ll ap = aa;
    ll ans = 1;
    while (p > 0)
    {
        //cout<<"p="<<p<<",ap="<<ap<<endl;
        if (p & 1)
        { //奇数が真
            ans = (ans * ap) % mod;
        }
        p /= 2;
        ap = (ap * ap) % mod;
    }
    return ans;
}



struct UnionFind
{
    vector<ll> par;

    UnionFind(ll n) : par(n, -1) {}

    ll root(ll x)
    {
        if (par[x] < 0)
            return x;
        else
            return par[x] = root(par[x]);
    }

    bool issame(ll x, ll y)
    {
        return root(x) == root(y);
    }

    bool merge(ll x, ll y)
    {
        x = root(x);
        y = root(y);
        if (x == y)
            return false;
        if (par[x] > par[y])
            swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    ll size(ll x)
    {
        return -par[root(x)];
    }
};

//小数点12桁
struct all_init
{
    all_init()
    {
        cout << fixed << setprecision(12);
    }
} All_init;

int main()
{
    ll n,x=0,y=0,z=0;
    cin>>n;
    string s;
    cin>>s;
    V r,g;
    set<ll>b;
    rep(i,0,n){
        if(s[i]=='R'){
            r.push_back(i);
        }
        if(s[i]=='G'){
            g.push_back(i);
        }
        if(s[i]=='B'){
            b.insert(i);
        }
    }
    ll cnt=0;
    rep(i,0,r.size()){
        rep(j,0,g.size()){
            if((r[i]+g[j])/2.0==(r[i]+g[j])/2&&b.find((r[i]+g[j])/2.0)!=b.end()){
                //cout<<(r[i]+g[j])/2.0<<endl;
                cnt++;
            }
            if(b.find(max(r[i],g[j])+abs(r[i]-g[j]))!=b.end()){
                cnt++;
            }
            if(b.find(min(r[i],g[j])-abs(r[i]-g[j]))!=b.end()){
                cnt++;
            }

            
            /*
            ll midb=LLONG_MAX;
            if((r[i]+g[j])/2.0>=b[0]&&(r[i]+g[j])/2.0<=b[b.size()-1]){
                midb=(ll)(lower_bound(all(b),(r[i]+g[j])/2.0)-b.begin());
            }
            ll leftb=-1,rightb=LLONG_MAX;
            if(max(r[i],g[j])+abs(r[i]-g[j])<=b[b.size()-1]){
                rightb=(ll)(lower_bound(all(b),max(r[i],g[j])+abs(r[i]-g[j]))-b.begin());
            }
            if(min(r[i],g[j])-abs(r[i]-g[j])>=b[0]){
                leftb=(ll)(lower_bound(all(b),min(r[i],g[j])-abs(r[i]-g[j]))-b.begin());
            }

            if(midb<b.size()&&midb>=0&&b[midb]==(r[i]+g[j])/2.0){
                //cout<<r[i]<<" "<<g[j]<<" "<<(r[i]+g[j])/2.0<<endl;
                cnt++;
            }
            if(rightb<b.size()&&b[rightb]==max(r[i],g[j])+abs(r[i]-g[j])){
                cnt++;
            }
            if(leftb>=0&&b[leftb]==min(r[i],g[j])-abs(r[i]-g[j])){
                cnt++;
            }

/*
            if(abs(r[i]-g[j])==abs(b[k]-g[j])||
            abs(r[i]-b[k])==abs(r[i]-g[j])||
            abs(r[i]-b[k])==abs(b[k]-g[j])){
                cnt++;
            }
*/
        }
    }
    cout<<r.size()*g.size()*b.size()-cnt<<endl;


    
    
}

Measured memory_bytes: 3728