using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Diagnostics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using System.Numerics;
using System.IO;
using System.Runtime.InteropServices;
using static System.Math;
using static Math2;
using static io;
using static Utils;

public class CompetitiveProgramming
{
  public void Solve()
  {
    var N = Int1;
    var S = Str;
    var sum = new int[N + 1][];
    for (int i = 0; i < N + 1; ++i)
    {
      sum[i] = new int[3];
    }
    for (int i = 0; i < N; ++i)
    {
      for (int j = 0; j < 3; ++j)
      {
        if (S[i] == 'R')
        {
          sum[i + 1][0] = sum[i][0] + 1;
          sum[i + 1][1] = sum[i][1];
          sum[i + 1][2] = sum[i][2];
        }
        if (S[i] == 'G')
        {
          sum[i + 1][0] = sum[i][0];
          sum[i + 1][1] = sum[i][1] + 1;
          sum[i + 1][2] = sum[i][2];
        }
        if (S[i] == 'B')
        {
          sum[i + 1][0] = sum[i][0];
          sum[i + 1][1] = sum[i][1];
          sum[i + 1][2] = sum[i][2] + 1;
        }

      }
    }
    long ans = 0;
    for (int i = 0; i < N; ++i)
    {
      for (int j = i + 1; j < N; ++j)
      {
        if (S[i] == S[j]) continue;
        if (S[i] == 'R' && S[j] == 'G')
        {
          ans += sum[N][2] - sum[j + 1][2];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'B') --ans;
        }
        if (S[i] == 'R' && S[j] == 'B')
        {
          ans += sum[N][1] - sum[j + 1][1];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'G') --ans;
        }
        if (S[i] == 'B' && S[j] == 'G')
        {
          ans += sum[N][0] - sum[j + 1][0];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'R') --ans;
        }
        if (S[i] == 'G' && S[j] == 'R')
        {
          ans += sum[N][2] - sum[j + 1][2];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'B') --ans;
        }
        if (S[i] == 'B' && S[j] == 'R')
        {
          ans += sum[N][1] - sum[j + 1][1];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'G') --ans;
        }
        if (S[i] == 'G' && S[j] == 'B')
        {
          ans += sum[N][0] - sum[j + 1][0];
          if (2 * j - i >= N) continue;
          if (S[2 * j - i] == 'R') --ans;
        }
      }
    }
    Write(ans);
  }


}



public static class Math2
{
  public const int INF = 1 << 29;
  public const long INFL = 1L << 60;
  public const int MOD = 1000000007;
  public const int MOD2 = 998244353;

  public static long Pow(long i, long N, long MOD = 1000000007)
  {
    long res = 1;
    while (N > 0)
    {
      if ((N & 1) != 0) res = res * i % MOD;
      i = i * i % MOD;
      N >>= 1;
    }
    return res;
  }
  public static long GCD(long i, long N)
  {
    if (i > N) Swap(ref i, ref N);
    if (i == 0) return N;
    while (N != 0)
    {
      var r = i % N;
      i = N;
      N = r;
    }
    return i;
  }
  public static long LCM(long i, long N) => i * N / GCD(i, N);
  public static long Comb(long N, long R, int MOD = 1000000007)
  {
    long ret = 1;
    long x = 1;
    for (long i = N; i >= N - R + 1; --i)
    {
      ret = ret / x * i;
      ret %= MOD;
      x++;
    }
    return ret;
  }
  public static long Comb2(long N, long R)
  {
    long Nume = 1;
    long Deno = 1;

    if (R > N - R) Swap(ref N, ref R);
    for (long i = 1; i <= R; ++i)
    {
      Deno *= i;
      Nume *= N - i + 1;
    }
    return Deno / Nume;
  }

}
public static class Utils
{
  public static void Swap<T>(ref T A, ref T B)
  {
    T x = A;
    A = B;
    B = x;
  }
  public static int DigitSum(int N)
  {
    string s = N.ToString();
    int ret = 0;
    for (int i = 0; i < s.Length; ++i) ret += s[i] - '0';
    return ret;
  }
}
class Program
{
  static void Main(string[] args)
  {
    var CompetitiveProgramming = new CompetitiveProgramming();
    CompetitiveProgramming.Solve();
  }
}
public static class io
{
  public static string Str => Console.ReadLine();
  public static string[] Strs => Str.Split(' ');
  public static long[] Longs => Strs.Select(long.Parse).ToArray();
  public static int[] Ints => Strs.Select(int.Parse).ToArray();
  public static char[] Chars => Str.ToArray();
  public static double[] Doubles => Strs.Select(double.Parse).ToArray();
  public static long Long1 => Longs[0];
  public static int Int1 => Ints[0];
  public static char Char1 => Chars[0];
  public static double Double1 => Doubles[0];
  public static long[] VerticalRead(int N) { long[] A = new long[N]; for (int i = 0; i < N; ++i) A[i] = Long1; return A; }
  public static void Write(string a) => Console.WriteLine(a);
  public static void Write(params object[] i) => Write(string.Join(" ", i));
  public static void Write<T>(IEnumerable<T> a) => Write(string.Join(" ", a));
  public static void Verticalwrite<T>(IEnumerable<T> a) { foreach (var z in a) Write(z); }
  public static void YN(bool i) { if (i) Write("Yes"); else Write("No"); }


  public static bool IsTypeEqual<T, U>() => typeof(T).Equals(typeof(U));
  public static T ConvertType<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
  public static T Cast<T>(string s)
  {
    if (IsTypeEqual<T, int>()) return ConvertType<T, int>(int.Parse(s));
    else if (IsTypeEqual<T, long>()) return ConvertType<T, long>(long.Parse(s));
    else if (IsTypeEqual<T, double>()) return ConvertType<T, double>(double.Parse(s));
    else if (IsTypeEqual<T, char>()) return ConvertType<T, char>(char.Parse(s));
    else return ConvertType<T, string>(s);
  }
  public static (T, U) Cin<T, U>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1])); }
  public static (T, U, V) Cin<T, U, V>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1]), Cast<V>(t[2])); }
  public static (T, U, V, W) Cin<T, U, V, W>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1]), Cast<V>(t[2]), Cast<W>(t[3])); }
  public static (T, U, V, W, X) Cin<T, U, V, W, X>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1]), Cast<V>(t[2]), Cast<W>(t[3]), Cast<X>(t[4])); }
  public static (T, U, V, W, X, Y) Cin<T, U, V, W, X, Y>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1]), Cast<V>(t[2]), Cast<W>(t[3]), Cast<X>(t[4]), Cast<Y>(t[5])); }
  public static (T, U, V, W, X, Y, Z) Cin<T, U, V, W, X, Y, Z>() { var t = Strs; return (Cast<T>(t[0]), Cast<U>(t[1]), Cast<V>(t[2]), Cast<W>(t[3]), Cast<X>(t[4]), Cast<Y>(t[5]), Cast<Z>(t[6])); }
}


Measured memory_bytes: 28344