#include <bits/stdc++.h>
using namespace std;
#define ll                      long long
#define pb                      push_back
#define rep(i,a,b,c)            for(ll i=(a);i<=(b);i+=(c))
#define repb(i,a,b,c)           for(ll i=(a);i>=(b);i-=(c))
#define MOD                     1000000007
#define inf                     3e18
#define ld                      long double
#define mp                      make_pair
#define vpll                    vector<pair<ll,ll> >
#define vll                     vector<ll>
#define vld                     vector<ld>
#define vvll                    vector<vector<ll>>
#define vvld                    vector<vector<ld>>
#define pll                     pair<ll,ll>
#define vvpll                   vector<vector<pair<ll,ll>>>
#define pqll                    priority_queue<ll>
#define mll                     map<ll,ll>
#define mlc                     map<ll,char>
#define um                      unordered_map
#define umll                    um<ll,ll>
#define umlc                    um<ll,char>
#define all(x)                  x.begin(),x.end()
#define fi                      first
#define se                      second
#define ln                      cout<<"\n";
#define endl                    "\n"
#define test                    ll T;cin>>T;while(T--)
#define isvowel(a)              (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define fastIO                  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define show(w,size)            for(ll i=0;i<size;i++) cout<<w[i]<<" ";
#define prll(a)                 cout<<a<<"\n";
#define mset(dp,no)             memset(dp,no,sizeof(dp))
#define input(a,n)              rep(i,0,n-1,1) cin>>a[i];
#define countbit                __builtin_popcount                                           //Number of setbits in decimal notation
#define lb(v,cur)               lower_bound(all(v),cur)-v.begin()
#define ub(v,cur)               upper_bound(all(v),cur)-v.begin()
#define db(...)                 __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 <<'\n'; }
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
    const char* comma = strchr(names + 1, ',');
    cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
long long pows(long long a, long long b) {
  long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
ll powm(ll x,ll y,ll m=MOD){x=x%m;ll res=1;while(y){if(y&1)res=res*x;res%=m;y=y>>1;x=x*x;x%=m;}return res;}
ll modInverse(ll a, ll m=MOD){if(m == 1)return 0;ll m0=m,y=0,x=1;while(a>1){ll q=a/m,t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}
int main()
{
fastIO
ll n,m,i,j,k,x,y,z,t,e,f,p,q,g,l,r,w,h,count1=0,prod=1,a,b,c,d,index,x1,x2,y1,y2,diff,ans=0,sum=0,sum1=0,sum2=0,flag=0,flag1=0,flag2=0;
string s,s1,s2;
cin>>n;
cin>>s;
set<ll>red,green,blue;
ll dp1[n+1]={0},dp2[n+1]={0},dp3[n+1]={0};
r=0,g=0,b=0;
for(i=0;i<n;i++)
{
  if(i!=0)
  {
    dp1[i]=dp1[i-1];
    dp2[i]=dp2[i-1];
    dp3[i]=dp3[i-1];
  }
  if(s[i]=='R')
  {
    red.insert(i);
    dp1[i]++;
  }
  else if(s[i]=='G')
  {
    green.insert(i);
    dp2[i]++;
  }
  else
  {
    blue.insert(i);
    dp3[i]++;
  }
}
r=dp1[n-1],g=dp2[n-1],b=dp3[n-1];
set<ll>::iterator it;
for(auto i:red)
{
  it=green.lower_bound(i);
  if(it!=green.end())
  {
    for(;it!=green.end();it++)
    {
      j=*it;
      diff=j-i;
      ll left=b-dp3[j];
      if(blue.find(j+diff)!=blue.end())
      {
        left--;
      }
      ans+=left;
    }
  }
}
for(auto i:red)
{
  it=blue.lower_bound(i);
  if(it!=blue.end())
  {
    for(;it!=blue.end();it++)
    {
    j=*it;
    diff=j-i;
    ll left=g-dp2[j];
    if(green.find(j+diff)!=green.end())
    {
      left--;
    }
    ans+=left;
    }
  }
}
for(auto i:green)
{
  it=red.lower_bound(i);
  if(it!=red.end())
  {
    for(;it!=red.end();it++)
    {
    j=*it;
    diff=j-i;
    ll left=b-dp3[j];
    if(blue.find(j+diff)!=blue.end())
    {
      left--;
    }
    ans+=left;
  }
  }
}

for(auto i:green)
{
  it=blue.lower_bound(i);
  if(it!=blue.end())
  {
    for(;it!=blue.end();it++)
    {
    j=*it;
    diff=j-i;
    ll left=r-dp1[j];
    if(red.find(j+diff)!=red.end())
    {
      left--;
    }
    ans+=left;
  }
}
}

for(auto i:blue)
{
  it=red.lower_bound(i);
  if(it!=red.end())
  {
    for(;it!=red.end();it++)
    {
    j=*it;
    diff=j-i;
    ll left=g-dp2[j];
    if(green.find(j+diff)!=green.end())
    {
      left--;
    }
    ans+=left;
  }
}
}

for(auto i:blue)
{
  it=green.lower_bound(i);
  if(it!=green.end())
  {
    for(;it!=green.end();it++)
    {
    j=*it;
    diff=j-i;
    ll left=r-dp1[j];
    if(red.find(j+diff)!=red.end())
    {
      left--;
    }
    ans+=left;
  }
}
}
cout<<ans;
}


Measured memory_bytes: 3856