write a go solution for B. Beautiful Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a binary^∗ string s of length n.Your task is to find any subsequence^† p of s such that:  The subsequence p is non-decreasing. That is, each character in p is not greater than the next one.  Let x denote the string obtained by removing all characters of p from s, while preserving the order of the remaining characters. Then x must be a palindrome^‡. You only need to output any valid subsequence p that satisfies both conditions. If no such subsequence exists, output -1.Note that an empty string is both non-decreasing and a palindrome.^∗A binary string is a string consisting of characters '0' and '1'.^†A subsequence of a string s=s_1s_2ldotss_n is a sequence p=s_i_1s_i_2ldotss_i_k such that 1<=i_1<i_2<ldots<i_k<=n. The characters are selected in order, but not necessarily contiguously. Note that an empty string is a subsequence of any string. ^‡A string t=t_1t_2ldotst_m is a palindrome if t_i=t_m-i+1 for all 1<=i<=m. In other words, the string reads the same forward and backward. InputThe first line contains a single integer t (1<=t<=3000) — the number of test cases.The first line of each test case contains a single integer n (1<=n<=10) — the length of the string.The second line contains a binary string s of length n.OutputIf a solution exists:   On the first line, print a single integer k (0<=k<=n) — the length of the subsequence p.  On the second line, print k distinct integers i_1,i_2,...,i_k (1<=i_1<i_2<...<i_k<=n) — the indices of the characters in s that form p (in order as they appear in s). Otherwise, print a single line containing -1.ExampleInput5301030015001118110100116100101Output022 351 2 3 4 523 425 6NoteIn the first test case, we remove an empty string, resulting in x=texttt010, which is a palindrome.In the second test case, we remove p=texttt01 (indices 2, 3), resulting in x=texttt0, which is a palindrome.In the third test case, we remove p=texttt00111 (indices 1 to 5), resulting in an empty string, which is trivially a palindrome.In the fourth test case, we remove p=texttt01 (indices 3, 4), resulting in x=texttt110011, which is a palindrome.In the fifth test case, we remove p=texttt01 (indices 5, 6), resulting in x=texttt1001, which is a palindrome.. Output only the code with no comments, explanation, or additional text.