Red, Green and Blue Given a pixel sequence consisting of red, green and blue pixels find the count of all contiguous subsequences such that each subsequence has a minimum length of 3 and the sequence cycles between red r, green g and blue b. For eg. if the sequence starts with g then the next character in the sequence should be b and the next should be r and so on. Input Format First line of test case consists of an integer t denoting the number of test cases. Next t test cases follow. Each test case consists of two lines. First line of each test case is the length of the pixel sequence. Second line is the pixel sequence. Sample Input 5 3 rgb 4 brgb 2 rg 1 b 16 rgbrbbrgbgbrgrgb Sample Output 1 3 S&W 0 0 10