write a go solution for D. Gellyfish and Forget-Me-Nottime limit per test2 secondsmemory limit per test1024 megabytesinputstandard inputoutputstandard output Gellyfish and Flower are playing a game.The game consists of two arrays of n integers a_1,a_2,ldots,a_n and b_1,b_2,ldots,b_n, along with a binary string c_1c_2ldotsc_n of length n.There is also an integer x which is initialized to 0.The game consists of n rounds. For i=1,2,ldots,n, the round proceeds as follows:  If c_i=mathtt0, Gellyfish will be the active player. Otherwise, if c_i=mathtt1, Flower will be the active player.  The active player will perform exactly one of the following operations:   Set x:=xoplusa_i.  Set x:=xoplusb_i.  Here, oplus denotes the bitwise XOR operation. Gellyfish wants to minimize the final value of x after n rounds, while Flower wants to maximize it. Find the final value of x after all n rounds if both players play optimally.InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows. The first line of each test case contains a single integer n (1<=n<=10^5) — the number of rounds of the game.The second line of each test case contains n integers a_1,a_2,ldots,a_n (0<=a_i<2^60).The third line of each test case contains n integers b_1,b_2,ldots,b_n (0<=b_i<2^60).The fourth line of each test case contains a binary string c of length n.It is guaranteed that the sum of n over all test cases does not exceed 10^5.OutputFor each test case, output a single integer — the final value of x after all n rounds.ExampleInput51020212 213 31136 1 26 2 301041 12 7 24 14 4 2011190 5 10 6 6 2 6 2 117 3 15 3 6 7 6 7 8110010010Output0
15
6
11
5
NoteIn the first test case, there's only one round and Gellyfish is the active player of that round. Therefore, she will choose a_1, and the final value of x is 0.In the second test case, Flower will be the active player in both rounds. She will choose a_1 and b_2, and the final value of x is a_1oplusb_2=15. Flower may also choose b_1 and a_2 instead for the same result of x=a_2oplusb_1=15.In the third test case, a_1=b_1 so it doesn't matter what decision Gellyfish makes in the first round. In the second round:  If Flower chooses a_2, then x will become 7. Gellyfish will choose b_3 in the third round, so the final value of x will be 4.  Otherwise, Flower chooses b_2, then x will become 4. Gellyfish will choose a_3 in the third round, so the final value of x will be 6. Flower wants to maximize the final value of x, so Flower will choose b_2 in the second round. Therefore, the final value of x will be 6.. Output only the code with no comments, explanation, or additional text.