Problem:
Score : 400 points

Problem Statement

We have a string S of length N consisting of R, G, and B.

Find the number of triples (i,~j,~k)~(1 \leq i < j < k \leq N) that satisfy both of the following conditions:

S_i \neq S_j, S_i \neq S_k, and S_j \neq S_k.

j - i \neq k - j.

Constraints

1 \leq N \leq 4000

S is a string of length N consisting of R, G, and B.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the number of triplets in question.

Sample Input 1

4
RRGB

Sample Output 1

1

Only the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.

Sample Input 2

39
RBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB

Sample Output 2

1800

Solution in Perl (5.26.1) (judge verdict: Time Limit Exceeded)

use v5.26; # strict say state biwise
use warnings;
use List::Util qw(reduce any all none notall first max maxstr min minstr product sum sum0 pairs unpairs pairkeys pairvalues pairfirst pairgrep pairmap shuffle uniq uniqnum uniqstr);

chomp (my $n = <STDIN>);
chomp (my $s = <STDIN>);
my @s = (0, split('', $s));
my @p;
for my $i (1..$n) {
  push @p, $s[$i];
  push @p, $i;
}
my (@r, @g, @b);
@r = pairvalues pairgrep { $a eq 'R' } @p;
@g = pairvalues pairgrep { $a eq 'G' } @p;
@b = pairvalues pairgrep { $a eq 'B' } @p;
my $ans = 0;
for my $i (@r) {
  for my $j (@g) {
    for my $k (@b) {
      my $max = max($i, $j, $k);
      my $min = min($i, $j, $k);
      my $mid = sum($i, $j, $k) - $max - $min;
      $ans++ if $mid - $min != $max - $mid;
    }
  }
}
say $ans;