/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define flsh '\n'<<flush
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAX3 2010
#define MAX4 20010
#define MAX5 200010
#define MAX6 2000010
#define MOD1 1000000007
#define MOD2 998244353

//cin.ignore (7777, '\n');

using namespace std;
using namespace __gnu_pbds;

#define debug(args...)(Debugger()) , args
class Debugger
{
  public:
  Debugger(const std::string& _separator=", ") :
  first(true),separator(_separator){}
  template<typename ObjectType>
  Debugger& operator,(const ObjectType& v)
  {
        if(!first)cerr<<separator;
        cerr<<v;
        first=false;
        return *this;
  }
  ~Debugger() {cerr<<endl;}      
  private:
    bool first;
    string separator;
};
 
template <typename T1, typename T2>
inline ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p)
{
   return os<<"("<<p.first<<", "<<p.second<<")";
}
template<typename T>
inline ostream &operator<<(ostream & os,const vector<T>& v)
{
    bool first=true;
    os<<"[";
    for(unsigned ll i=0;i<v.size();i++)
    {
        if(!first)os<<", ";
        os<<v[i];
        first=false;
    }
        return os<<"]";
}
template<typename T>
inline ostream &operator<<(ostream & os,const set<T>&v)
{
    bool first=true;
    os<<"[";
    for(typename set<T>::const_iterator ii=v.begin();ii!=v.end();++ii)
    {
        if(!first)os<<", ";
        os<<*ii;
        first=false;
    }
    return os<<"]";
}
template<typename T1, typename T2>
inline ostream &operator<<(ostream & os,const map<T1, T2>&v)
{
        bool first=true;
        os<<"[";
        for(typename map<T1,T2>::const_iterator ii=v.begin(); ii!=v.end();++ii)
        {
            if(!first)os<<", ";
            os<<*ii;
            first=false;
        }
        return os<<"]";
}

ll n;
ll ans=0;
vector<ll>one;
vector<ll>two;
vector<ll>three;


void f(vector<ll>&one,vector<ll>&two,vector<ll>&three)
{
 for(ll i=0;i<(ll)one.size();i++)
 {
  if(lower_bound(all(two),one[i])!=two.end())
  {
    ll pos=lower_bound(all(two),one[i])-two.begin();
    for(ll j=pos;j<(ll)two.size();j++)
    {
     if(lower_bound(all(three),two[j])!=three.end())
     {
	   ll raz=two[j]-one[i];
	   ll kol=(ll)three.size()-(lower_bound(all(three),two[j])-three.begin());
	   if(binary_search(all(three),two[j]+raz))kol--;
	   ans+=kol; 
	 }
    }
  }
  if(lower_bound(all(three),one[i])!=three.end())
  {
    ll pos=lower_bound(all(three),one[i])-three.begin();
    for(ll j=pos;j<(ll)three.size();j++)
    {
      if(lower_bound(all(two),three[j])!=two.end())
     {
	   ll raz=three[j]-one[i];
	   ll kol=(ll)two.size()-(lower_bound(all(two),three[j])-two.begin());
	   if(binary_search(all(two),three[j]+raz))kol--;
	   ans+=kol; 
	 }
    }
  }
 }	
}

int main(){
FAST_READ;
ll n;
cin>>n;
string stroka;
cin>>stroka;
for(ll i=0;i<(ll)stroka.size();i++)
{ 
  if(stroka[i]=='R')one.pb(i);
  else if(stroka[i]=='G')two.pb(i);
  else three.pb(i);	
}

f(one,two,three);
f(two,one,three);
f(three,one,two);
cout<<ans<<endl;





return 0;
} 


Measured memory_bytes: 3696