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: Time Limit Exceeded)

program main
    implicit none
    integer n
    integer, dimension(4000) :: r, g, b
    integer i, j, k, ir, ig, ib
    integer nr, ng, nb, d1, d2
    integer c, d
    character s*4000
    read(*,*) n
    read(*,*) s

    do i = 1,4000
        r(i) = 0
        g(i) = 0
        b(i) = 0
    end do

    ir = 1
    ig = 1
    ib = 1

    do i = 1,n
        if(s(i:i) == "R") then
            r(ir) = i
            ir = ir + 1
        else if(s(i:i) == "G") then
            g(ig) = i
            ig = ig + 1
        else if(s(i:i) == "B") then
            b(ib) = i
            ib = ib + 1
        end if
    end do
    
    nr = ir - 1
    ng = ig - 1
    nb = ib - 1
    c = 0
    d = 0

    do ir = 1, nr
        do ig = 1, ng
            do ib = 1, nb
                i = min(r(ir),g(ig),b(ib))
                k = max(r(ir),g(ig),b(ib))
                j = r(ir) + g(ig) + b(ib) - i - k
                if((j-i) == (k-j)) then
                    d = d + 1
                end if
            end do
        end do
    end do
    write(*,*) nr*ng*nb - d

end program