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 Fortran (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program main
  implicit none
  integer(8) :: n, i, j, kng, cr(0:4000), cb(0:4000), cg(0:4000)
  integer(8) :: res
  character(4000) :: s
  character(2) :: sij

  read *, n
  read *, s
  cr = 0
  cb = 0
  cg = 0
  do i = 1, n
    cr(i) = cr(i - 1)
    cb(i) = cb(i - 1)
    cg(i) = cg(i - 1)
    if (s(i:i) == "R") then
      cr(i) = cr(i) + 1
    else if (s(i:i) == "G") then
      cg(i) = cg(i) + 1
    else
      cb(i) = cb(i) + 1
    end if
  end do
  res = 0
  do i = 1, n - 2
    do j = i + 1, n - 1
      if (s(i:i) == s(j:j)) cycle
      sij = s(i:i) // s(j:j)
      kng = j + j - i
      if (sij == "RG" .or. sij == "GR") then
        res = res + cb(n) - cb(j)
        if (s(kng:kng) == "B") res = res - 1
      else if (sij == "RB" .or. sij == "BR") then
        res = res + cg(n) - cg(j)
        if (s(kng:kng) == "G") res = res - 1
      else
        res = res + cr(n) - cr(j)
        if (s(kng:kng) == "R") res = res - 1
      end if
    end do
  end do
  print "(i0)", res
end program main