write a go solution for F. Palindrome Everywheretime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a cycle with n vertices numbered from 0 to n-1. For each 0<=i<=n-1, there is an undirected edge between vertex i and vertex ((i+1)bmodn) with the color c_i (c_i=textttR or textttB).Determine whether the following condition holds for every pair of vertices (i,j) (0<=i<j<=n-1): There exists a palindrome route between vertex i and vertex j. Note that the route may not be simple. Formally, there must exist a sequence p=[p_0,p_1,p_2,ldots,p_m] such that: p_0=i, p_m=j;  For each 0<=x<=m-1, either p_x+1=(p_x+1)bmodn or p_x+1=(p_x-1)bmodn;  For each 0<=x<=y<=m-1 satisfying x+y=m-1, the edge between p_x and p_x+1 has the same color as the edge between p_y and p_y+1.InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^5) — the number of test cases. The description of the test cases follows.The first line of each test case contains an integer n (3<=n<=10^6) — the number of vertices in the cycle.The second line contains a string c of length n (c_i=textttR or textttB) — the color of each edge.It is guaranteed that the sum of n over all test cases does not exceed 10^6.OutputFor each test case, print "YES" (without quotes) if there is a palindrome route between any pair of nodes, and "NO" (without quotes) otherwise.You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.ExampleInput75RRRRR5RRRRB5RBBRB6RBRBRB6RRBBRB5RBRBR12RRBRRBRRBRRBOutputYES
YES
YES
NO
NO
YES
NO
NoteIn the first test case, it is easy to show that there is a palindrome route between any two vertices.In the second test case, for any two vertices, there exists a palindrome route with only red edges.In the third test case, the cycle is as follows: 0colorredoversettextttRlongarrow1colorblueoversettextttBlongarrow2colorblueoversettextttBlongarrow3colorredoversettextttRlongarrow4colorblueoversettextttBlongarrow0. Take (i,j)=(0,3) as an example, then 0colorredoversettextttRlongarrow1colorblueoversettextttBlongarrow2colorblueoversettextttBlongarrow3colorredoversettextttRlongarrow4colorblueoversettextttBlongarrow0colorblueoversettextttBlongarrow4colorredoversettextttRlongarrow3 is a palindrome route. Thus, the condition holds for (i,j)=(0,3).In the fourth test case, when (i,j)=(0,2), there does not exist a palindrome route.. Output only the code with no comments, explanation, or additional text.