#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

std::string pad(int num)
{
    char buffer[4];
    std::snprintf(buffer, sizeof(buffer), "%03d", num);
    return buffer;
}

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif

int solve()
{
    int N;

    std::cin >> N;

    string s;
    cin >> s;

    ll count = 0;

    unordered_set<int> xr, xg, xb;

    for (int i = 0; i < s.length(); ++i) {

        if (s[i] == 'R') {
            count += xg.size() * xb.size();

            for (auto &itg : xg) {
                if (xb.count(itg - (i - itg)))
                    count--;
            }
            for (auto &itb : xb) {
                if (xg.count(itb - (i - itb)))
                    count--;
            }
            xr.insert(i);
        }
        if (s[i] == 'G') {
            count += xr.size() * xb.size();

            for (auto &itr : xr) {
                if (xb.count(itr - (i - itr)))
                    count--;
            }
            for (auto &itb : xb) {
                if (xr.count(itb - (i - itb)))
                    count--;
            }
            xg.insert(i);
        }
        if (s[i] == 'B') {
            count += xg.size() * xr.size();

            for (auto &itg : xg) {
                if (xr.count(itg - (i - itg)))
                    count--;
            }
            for (auto &itr : xr) {
                if (xg.count(itr - (i - itr)))
                    count--;
            }
            xb.insert(i);
        }

    }

    cout << count << endl;

    return 0;
}

int main()
{
//    std::cout << solve() << std::endl;
    solve();

    return 0;
}

Measured memory_bytes: 3736