题目描述
Here is your task. You are given an array and you have to find the maximum possible length of subarray In that subarray a[i+1]%a[i]==0
Every element in subarray is divisible by its previous element
Your task is to find maximum length of subarray.
INPUT first line conatin number of test cases T. Each test case contain number of element in array N.Next line contain elements of array.
OUTPUT print maximum length of subarray
Constraints
1 ≤ T ≤ 100
1 ≤ N ≤ 1000000
1 ≤ a[i] ≤ 1000000
SAMPLE INPUT
1
6
5 3 10 12 25 20
SAMPLE OUTPUT
3
Explanation
Subarray of maximum length conatins 5 10 20
输入格式
见题面
输出格式
见题面
样例输入
10
41
68 35 1 70 25 79 59 63 65 6 46 82 28 62 92 96 43 28 37 92 5 3 54 93 83 22 17 19 96 48 27 72 39 70 13 68 100 36 95 4 12
22
34 74 65 42 12 54 69 48 45 63 58 38 60 24 42 30 79 17 36 91 43 89
6
41 43 65 49 47 6
90
30 71 51 7 2 94 49 30 24 85 55 57 41 67 77 32 9 45 40 27 24 38 39 19 83 30 42 34 16 40 59 5 31 78 7 74 87 22 46 25 73 71 30 78 74 98 13 87 91 62 37 56 68 56 75 32 53 51 51 42 25 67 31 8 92 8 38 58 88 54 84 46 10 10 59 22 89 23 47 7 31 14 69 1 92 63 56 11 60 25
37
49 84 96 42 3 51 92 37 75 21 97 22 49 100 69 85 82 35 54 100 19 39 1 89 28 68 29 94 49 84 8 22 11 18 14 15 10
16
36 52 1 50 20 57 99 4 25 9 45 10 90 3 96 86
93
44 24 88 15 4 49 1 59 19 81 97 99 82 90 99 10 58 73 23 39 93 39 80 91 58 59 92 16 89 57 12 3 35 73 56 29 47 63 87 76 34 70 43 45 17 82 99 23 52 22 100 58 77 93 90 76 13 1 11 4 70 62 89 2 90 56 24 3 86 83 86 89 27 18 58 33 33 70 55 22 90 77 30 69 93 26 56 35 50 42 13 46 61
18
54 40 24 80 97 88 30 50 38 67 50 94 96 98 17 87 6 89
82
56 35 15 2 17 72 87 64 14 56 86 54 13 9 33 46 14 57 22 59 47 83 82 45 97 23 30 62 36 51 74 67 45 60 93 40 54 25 55 11 46 50 87 14 75 23 69 19 88 6 59 92 3 26 78 15 15 25 35 75 73 60 34 71 88 98 19 78 74 71 64 69 93 86 3 81 14 28 3 100 28 26
43
25 24 73 62 82 4 33 6 94 26 32 93 43 23 87 65 1 88 61 14 75 71 71 36 34 12 61 97 68 86 51 41 95 96 25 20 26 77 95 59 3 72 67
样例输出
7
3
1
9
6
5
10
3
9
6