write a go solution for B. White Magictime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output  We call a sequence a_1,a_2,ldots,a_n magical if for all 1<=i<=n-1 it holds that: operatornamemin(a_1,ldots,a_i)>=operatornamemex(a_i+1,ldots,a_n). In particular, any sequence of length 1 is considered magical.The minimum excluded (MEX) of a collection of integers a_1,a_2,ldots,a_k is defined as the smallest non-negative integer t which does not occur in the collection a. You are given a sequence a of n non-negative integers. Find the maximum possible length of a magical subsequence^∗ of the sequence a.^∗A sequence a is a subsequence of a sequence b if a can be obtained from b by the deletion of several (possibly, zero or all) element from arbitrary positions. 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 an integer n (1<=qn<=q2*10^5) — the length of the sequence a.The second line of each test case contains n integers a_1,a_2,ldots,a_n (0<=a_i<=10^9) — the elements of the sequence a.It is guaranteed that the sum of n across all test cases does not exceed 2*10^5.OutputFor each test case, output a single number — the maximum possible length of a magical subsequence of the sequence a.ExampleInput854 3 2 1 064 3 3 2 1 042 0 1 2177741000000000 1 7 920 121 240 1 0 1Output5
5
3
1
4
2
2
3
NoteIn the first test case, the sequence [4,3,2,1,0] is magical, since: operatornamemin(4)=4,operatornamemex(3,2,1,0)=4. 4>=4 operatornamemin(4,3)=3,operatornamemex(2,1,0)=3. 3>=3 operatornamemin(4,3,2)=2,operatornamemex(1,0)=2. 2>=q2 operatornamemin(4,3,2,1)=1,operatornamemex(0)=1. 1>=1In the second test case, the sequence [4,3,3,2,1,0] is not magical, since operatornamemin(4,3)=3,operatornamemex(3,2,1,0)=4, 3<4. However, the subsequence [4,3,2,1,0] of this sequence is magical, so the answer is 5.. Output only the code with no comments, explanation, or additional text.