#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)

using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
    vector<ll> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    return A;
}
void OutputVec(vector<ll> A){
    for (int i = 0; i < A.size(); ++i) {
        cout << A[i] << ",";
    }
    cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
    vector<vector<ll>> A(H);
    for (int yi = 0; yi < H; ++yi) {
        A[yi] = vector<ll>(W);
    }
    for (int yi = 0; yi < H; ++yi) {
        for (int xi = 0; xi < W; ++xi) {
            cin >> A[yi][xi];
        }
    }
    return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
    vector<vector<char>> A(H);
    for (int yi = 0; yi < H; ++yi) {
        A[yi] = vector<char>(W);
    }
    for (int yi = 0; yi < H; ++yi) {
        string S;
        cin >> S;
        for (int xi = 0; xi < W; ++xi) {
            A[yi][xi] = S[xi];
        }
    }
    return A;
}
void OutputVec2d(vector<vector<ll>> A){
    for (int yi = 0; yi < A.size(); ++yi) {
        for (int xi = 0; xi < A[yi].size(); ++xi) {
            cout << A[yi][xi] << ",";
        }
        cout << endl;
    }
}
graph InputGraph(ll N,ll M){
    graph G(N);
    for (int i = 0; i < M; ++i) {
        ll a,b;
        cin >> a >> b;
        a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    return G;
}
graph InputDGraph(ll N,ll M){
    graph G(N);
    for (int i = 0; i < M; ++i) {
        ll a,b;
        cin >> a >> b;
        a--;b--;
        G[a].push_back(b);
    }
    return G;
}
void OutputGraph(graph G){
    for (int i = 0; i < G.size(); ++i) {
        cout << i << ":";
        for (int j = 0; j < G[i].size(); ++j) {
            cout << G[i][j]<< ",";
        }
        cout << endl;
    }
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
    if(b){
        if(isUpperCase){
            cout << "YES" << endl;
        }else{
            cout << "Yes" << endl;
        }
    }else{
        if(isUpperCase){
            cout << "NO" << endl;
        }else{
            cout << "No" << endl;
        }
    }
}


int main() {
    ll N;
    string S;
    cin >> N;
    cin >> S;
    vector<ll> R;
    vector<ll> G;
    vector<ll> B;
    for (int i = 0; i < N; ++i) {
        if(S[i] == 'R'){
            R.push_back(i);
        }
        if(S[i] == 'G'){
            G.push_back(i);
        }
        if(S[i] == 'B'){
            B.push_back(i);
        }
    }
    ll count = 0;
    count = R.size() * G.size() * B.size();
    //cout << count << endl;
    for (int i = 0; i < R.size(); ++i) {
        ll current = R[i];
        for (int j = 1; j < N / 2 + 10; ++j) {
            if(binary_search(G.begin(),G.end(),current + j) && binary_search(B.begin(),B.end(),current + 2 * j)){
                count--;
            }
            if(binary_search(B.begin(),B.end(),current + j) && binary_search(G.begin(),G.end(),current + 2 * j)){
                count--;
            }
        }
    }
    for (int i = 0; i < G.size(); ++i) {
        ll current = G[i];
        for (int j = 1; j < N / 2 + 10; ++j) {
            if(binary_search(R.begin(),R.end(),current + j) && binary_search(B.begin(),B.end(),current + 2 * j)){
                count--;
            }
            if(binary_search(B.begin(),B.end(),current + j) && binary_search(R.begin(),R.end(),current + 2 * j)){
                count--;
            }
        }
    }
    for (int i = 0; i < B.size(); ++i) {
        ll current = B[i];
        for (int j = 1; j < N / 2 + 10; ++j) {
            if(binary_search(G.begin(),G.end(),current + j) && binary_search(R.begin(),R.end(),current + 2 * j)){
                count--;
            }
            if(binary_search(R.begin(),R.end(),current + j) && binary_search(G.begin(),G.end(),current + 2 * j)){
                count--;
            }
        }
    }
    cout << count << endl;
}


Measured memory_bytes: 3684