B. Blank Spacetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a binary array a of n elements, a binary array is an array consisting only of 0s and 1s. A blank space is a segment of consecutive elements consisting of only 0s. Your task is to find the length of the longest blank space.InputThe first line contains a single integer t (1 \leq t \leq 1000) — the number of test cases.The first line of each test case contains a single integer n (1 \leq n \leq 100) — the length of the array.The second line of each test case contains n space-separated integers a_i (0 \leq a_i \leq 1) — the elements of the array.OutputFor each test case, output a single integer — the length of the longest blank space.ExampleInput
551 0 0 1 040 1 1 11031 1 191 0 0 0 1 0 0 0 1Output
2
1
1
0
3

551 0 0 1 040 1 1 11031 1 191 0 0 0 1 0 0 0 1
2 1 1 0 3 
['implementation', '*800']