B'Allen has an array a_1, a_2, ldots,a_n . For every positive integer k that is a divisor of n , Allen does the following: Help Allen find the number of points he will earn. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer n ( 1 <= q n <= q 2 cdot10^5 ) -- the length of the array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q n ) -- the elements of the array a . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output a single integer -- the number of points Allen will earn. In the first test case, k=2 earns a point since Allen can pick m = 2 and both subarrays will be equal to [1, 0] . k=4 also earns a point, since no matter what m Allen chooses, there will be only one subarray and thus all subarrays are equal. In the second test case, Allen earns 1 point for k=3 , where his choice for m does not matter. '...